| 1 | /*
|
|---|
| 2 | * WorkerPool.hpp
|
|---|
| 3 | *
|
|---|
| 4 | * Created on: 22.02.2012
|
|---|
| 5 | * Author: heber
|
|---|
| 6 | */
|
|---|
| 7 |
|
|---|
| 8 | #ifndef WORKERPOOL_HPP_
|
|---|
| 9 | #define WORKERPOOL_HPP_
|
|---|
| 10 |
|
|---|
| 11 | // include config.h
|
|---|
| 12 | #ifdef HAVE_CONFIG_H
|
|---|
| 13 | #include <config.h>
|
|---|
| 14 | #endif
|
|---|
| 15 |
|
|---|
| 16 | #include <map>
|
|---|
| 17 | #include <set>
|
|---|
| 18 | #include <string>
|
|---|
| 19 |
|
|---|
| 20 | #include "CodePatterns/Observer/Observable.hpp"
|
|---|
| 21 |
|
|---|
| 22 | #include "JobMarket/WorkerAddress.hpp"
|
|---|
| 23 |
|
|---|
| 24 | class FragmentQueue;
|
|---|
| 25 | class FragmentScheduler;
|
|---|
| 26 | class WorkerPoolTest;
|
|---|
| 27 |
|
|---|
| 28 | /** Class WorkerPool contains a number of PoolWorkers that connect to it
|
|---|
| 29 | * and wait for jobs to be sent to them. The class manages this pool of
|
|---|
| 30 | * workers.
|
|---|
| 31 | *
|
|---|
| 32 | */
|
|---|
| 33 | class WorkerPool : public Observable
|
|---|
| 34 | {
|
|---|
| 35 | //!> grant unit test access
|
|---|
| 36 | friend class WorkerPoolTest;
|
|---|
| 37 | public:
|
|---|
| 38 | WorkerPool();
|
|---|
| 39 | ~WorkerPool();
|
|---|
| 40 |
|
|---|
| 41 | /** Channels for this observable.
|
|---|
| 42 | *
|
|---|
| 43 | * \note Be especially cautious of cyclic updates here as the updates are
|
|---|
| 44 | * used by \ref FragmentScheduler to send new jobs to idle workers!
|
|---|
| 45 | * If e.g. WorkerRemoved is added, then the marking of the one idle
|
|---|
| 46 | * worker as now busy inside the callback will cause a cycle in the
|
|---|
| 47 | * update, as the notification for WorkerIdle/Added is not yet
|
|---|
| 48 | * removed because we are still inside the callback!
|
|---|
| 49 | */
|
|---|
| 50 | enum NotificationType {
|
|---|
| 51 | WorkerIdle,
|
|---|
| 52 | WorkerAdded,
|
|---|
| 53 | NotificationType_MAX // denotes the maximum of available notification types
|
|---|
| 54 | };
|
|---|
| 55 |
|
|---|
| 56 | bool addWorker(const WorkerAddress &address);
|
|---|
| 57 | bool presentInPool(const WorkerAddress &address) const;
|
|---|
| 58 | bool presentIdleWorkers() const {
|
|---|
| 59 | return !idle_queue.empty();
|
|---|
| 60 | }
|
|---|
| 61 | bool presentBusyWorkers() const {
|
|---|
| 62 | return !busy_queue.empty();
|
|---|
| 63 | }
|
|---|
| 64 | WorkerAddress getNextIdleWorker();
|
|---|
| 65 | bool isWorkerBusy(const WorkerAddress &address) const;
|
|---|
| 66 | bool removeWorker(const WorkerAddress& address);
|
|---|
| 67 | void unmarkWorkerBusy(const WorkerAddress &address);
|
|---|
| 68 |
|
|---|
| 69 | typedef std::vector<std::pair<std::string, std::string> > WorkerList_t;
|
|---|
| 70 | WorkerList_t getListOfIdleWorkers() const;
|
|---|
| 71 | //!> typedef for the pool of workers being a set to keep only unique addresses
|
|---|
| 72 | typedef std::set<WorkerAddress> Pool_t;
|
|---|
| 73 | const Pool_t& getPoolOfWorkers() const
|
|---|
| 74 | {
|
|---|
| 75 | return pool;
|
|---|
| 76 | }
|
|---|
| 77 |
|
|---|
| 78 | /** Return the number of busy workers.
|
|---|
| 79 | *
|
|---|
| 80 | * @return number in busy_queue
|
|---|
| 81 | */
|
|---|
| 82 | size_t getNoBusyWorkers() const
|
|---|
| 83 | {
|
|---|
| 84 | return busy_queue.size();
|
|---|
| 85 | }
|
|---|
| 86 |
|
|---|
| 87 | /** Return the number of idle workers.
|
|---|
| 88 | *
|
|---|
| 89 | * @return number in idle_queue
|
|---|
| 90 | */
|
|---|
| 91 | size_t getNoIdleWorkers() const
|
|---|
| 92 | {
|
|---|
| 93 | return idle_queue.size();
|
|---|
| 94 | }
|
|---|
| 95 |
|
|---|
| 96 | /** Return the number of total workers.
|
|---|
| 97 | *
|
|---|
| 98 | * @return sum of numbers in busy_queue and in idle_queue
|
|---|
| 99 | */
|
|---|
| 100 | size_t getNoTotalWorkers() const
|
|---|
| 101 | {
|
|---|
| 102 | return idle_queue.size() + busy_queue.size();
|
|---|
| 103 | }
|
|---|
| 104 |
|
|---|
| 105 | // this is currently for the passing time until Worker pool is fully operable
|
|---|
| 106 |
|
|---|
| 107 | //!> typedef of the priority in the idle queue of a worker
|
|---|
| 108 | typedef size_t priority_t;
|
|---|
| 109 |
|
|---|
| 110 | //!> typedef for the worker queue being a map with priority and address of worker
|
|---|
| 111 | typedef std::multimap<priority_t, WorkerAddress> Idle_Queue_t;
|
|---|
| 112 |
|
|---|
| 113 | // constant iterators on idle queue contents
|
|---|
| 114 | Idle_Queue_t::const_iterator begin_idle() const {
|
|---|
| 115 | return idle_queue.begin();
|
|---|
| 116 | }
|
|---|
| 117 | Idle_Queue_t::const_iterator end_idle() const {
|
|---|
| 118 | return idle_queue.end();
|
|---|
| 119 | }
|
|---|
| 120 |
|
|---|
| 121 | Idle_Queue_t::iterator getIdleWorker(const WorkerAddress &address);
|
|---|
| 122 | void markWorkerBusy(Idle_Queue_t::iterator &iter);
|
|---|
| 123 |
|
|---|
| 124 | bool hasBusyWorkers() const {
|
|---|
| 125 | return (busy_queue.size() != 0);
|
|---|
| 126 | }
|
|---|
| 127 |
|
|---|
| 128 | private:
|
|---|
| 129 | //!> FragmentScheduler needs access to removeAllWorkers()
|
|---|
| 130 | friend class FragmentScheduler;
|
|---|
| 131 | void removeAllWorkers();
|
|---|
| 132 |
|
|---|
| 133 | private:
|
|---|
| 134 | //!> static for defining default priority for new workers
|
|---|
| 135 | static priority_t default_priority;
|
|---|
| 136 |
|
|---|
| 137 | //!> empty address in case queue is idle
|
|---|
| 138 | static WorkerAddress emptyAddress;
|
|---|
| 139 |
|
|---|
| 140 | //!> pool of all worker addresses to connect to and work on jobs
|
|---|
| 141 | Pool_t pool;
|
|---|
| 142 |
|
|---|
| 143 | //!> pool of worker addresses to connect to and work on jobs
|
|---|
| 144 | Idle_Queue_t idle_queue;
|
|---|
| 145 |
|
|---|
| 146 | //!> typedef for the worker queue being a map with priority and address of worker
|
|---|
| 147 | typedef std::map<WorkerAddress, priority_t> Busy_Queue_t;
|
|---|
| 148 |
|
|---|
| 149 | //!> pool of worker addresses to connect to and work on jobs
|
|---|
| 150 | mutable Busy_Queue_t busy_queue;
|
|---|
| 151 |
|
|---|
| 152 | //!> states whether we accept new workers to the pool
|
|---|
| 153 | bool openForNewWorkers;
|
|---|
| 154 | };
|
|---|
| 155 |
|
|---|
| 156 | #endif /* WORKERPOOL_HPP_ */
|
|---|