[5d8c0f] | 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 "WorkerAddress.hpp"
|
---|
| 21 |
|
---|
| 22 | class FragmentQueue;
|
---|
| 23 | class WorkerPoolTest;
|
---|
| 24 |
|
---|
| 25 | /** Class WorkerPool contains a number of PoolWorkers that connect to it
|
---|
| 26 | * and wait for jobs to be sent to them. The class manages this pool of
|
---|
| 27 | * workers.
|
---|
| 28 | *
|
---|
| 29 | */
|
---|
| 30 | class WorkerPool
|
---|
| 31 | {
|
---|
| 32 | //!> grant unit test access
|
---|
| 33 | friend class WorkerPoolTest;
|
---|
| 34 | public:
|
---|
| 35 | WorkerPool();
|
---|
| 36 | ~WorkerPool();
|
---|
| 37 |
|
---|
| 38 | bool addWorker(const WorkerAddress &address);
|
---|
| 39 | bool presentInPool(const WorkerAddress &address) const;
|
---|
| 40 | bool presentIdleWorkers() const {
|
---|
| 41 | return !idle_queue.empty();
|
---|
| 42 | }
|
---|
| 43 | WorkerAddress getNextIdleWorker();
|
---|
| 44 | bool isWorkerBusy(const WorkerAddress &address) const;
|
---|
| 45 | bool removeWorker(const WorkerAddress& address);
|
---|
| 46 | void unmarkWorkerBusy(const WorkerAddress &address);
|
---|
| 47 |
|
---|
[41c1b7] | 48 | // this is currently for the passing time until Worker pool is fully operable
|
---|
| 49 |
|
---|
[5d8c0f] | 50 | //!> typedef of the priority in the idle queue of a worker
|
---|
| 51 | typedef size_t priority_t;
|
---|
| 52 |
|
---|
| 53 | //!> typedef for the worker queue being a map with priority and address of worker
|
---|
| 54 | typedef std::multimap<priority_t, WorkerAddress> Idle_Queue_t;
|
---|
| 55 |
|
---|
[41c1b7] | 56 | Idle_Queue_t::iterator getIdleWorker(const WorkerAddress &address);
|
---|
| 57 | void markWorkerBusy(Idle_Queue_t::iterator &iter);
|
---|
| 58 |
|
---|
| 59 | private:
|
---|
[5d8c0f] | 60 | //!> typedef for the worker queue being a map with priority and address of worker
|
---|
| 61 | typedef std::map<WorkerAddress, priority_t> Busy_Queue_t;
|
---|
| 62 |
|
---|
| 63 | //!> typedef for the pool of workers being a set to keep only unique addresses
|
---|
| 64 | typedef std::set<WorkerAddress> Pool_t;
|
---|
| 65 |
|
---|
| 66 | private:
|
---|
| 67 | void removeAllWorkers();
|
---|
| 68 |
|
---|
| 69 | private:
|
---|
| 70 | //!> static for defining default priority for new workers
|
---|
| 71 | static priority_t default_priority;
|
---|
| 72 |
|
---|
| 73 | //!> empty address in case queue is idle
|
---|
| 74 | static WorkerAddress emptyAddress;
|
---|
| 75 |
|
---|
| 76 | //!> pool of all worker addresses to connect to and work on jobs
|
---|
| 77 | Pool_t pool;
|
---|
| 78 |
|
---|
| 79 | //!> pool of worker addresses to connect to and work on jobs
|
---|
| 80 | Idle_Queue_t idle_queue;
|
---|
| 81 |
|
---|
| 82 | //!> pool of worker addresses to connect to and work on jobs
|
---|
| 83 | mutable Busy_Queue_t busy_queue;
|
---|
| 84 | };
|
---|
| 85 |
|
---|
| 86 | #endif /* WORKERPOOL_HPP_ */
|
---|