| 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 | 
 | 
|---|
| 48 |   // this is currently for the passing time until Worker pool is fully operable
 | 
|---|
| 49 | 
 | 
|---|
| 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 | 
 | 
|---|
| 56 |   Idle_Queue_t::iterator getIdleWorker(const WorkerAddress &address);
 | 
|---|
| 57 |   Idle_Queue_t::iterator getIdleEnd()
 | 
|---|
| 58 |   {
 | 
|---|
| 59 |     return idle_queue.end();
 | 
|---|
| 60 |   }
 | 
|---|
| 61 |   void markWorkerBusy(Idle_Queue_t::iterator &iter);
 | 
|---|
| 62 | 
 | 
|---|
| 63 | private:
 | 
|---|
| 64 |   //!> typedef for the worker queue being a map with priority and address of worker
 | 
|---|
| 65 |   typedef std::map<WorkerAddress, priority_t> Busy_Queue_t;
 | 
|---|
| 66 | 
 | 
|---|
| 67 |   //!> typedef for the pool of workers being a set to keep only unique addresses
 | 
|---|
| 68 |   typedef std::set<WorkerAddress> Pool_t;
 | 
|---|
| 69 | 
 | 
|---|
| 70 | private:
 | 
|---|
| 71 |   void removeAllWorkers();
 | 
|---|
| 72 | 
 | 
|---|
| 73 | private:
 | 
|---|
| 74 |   //!> static for defining default priority for new workers
 | 
|---|
| 75 |   static priority_t default_priority;
 | 
|---|
| 76 | 
 | 
|---|
| 77 |   //!> empty address in case queue is idle
 | 
|---|
| 78 |   static WorkerAddress emptyAddress;
 | 
|---|
| 79 | 
 | 
|---|
| 80 |   //!> pool of all worker addresses to connect to and work on jobs
 | 
|---|
| 81 |   Pool_t pool;
 | 
|---|
| 82 | 
 | 
|---|
| 83 |   //!> pool of worker addresses to connect to and work on jobs
 | 
|---|
| 84 |   Idle_Queue_t idle_queue;
 | 
|---|
| 85 | 
 | 
|---|
| 86 |   //!> pool of worker addresses to connect to and work on jobs
 | 
|---|
| 87 |   mutable Busy_Queue_t busy_queue;
 | 
|---|
| 88 | };
 | 
|---|
| 89 | 
 | 
|---|
| 90 | #endif /* WORKERPOOL_HPP_ */
 | 
|---|