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 "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 | enum NotificationType {
|
---|
42 | WorkerIdle,
|
---|
43 | WorkerAdded,
|
---|
44 | WorkerRemoved,
|
---|
45 | NotificationType_MAX // denotes the maximum of available notification types
|
---|
46 | };
|
---|
47 |
|
---|
48 | bool addWorker(const WorkerAddress &address);
|
---|
49 | bool presentInPool(const WorkerAddress &address) const;
|
---|
50 | bool presentIdleWorkers() const {
|
---|
51 | return !idle_queue.empty();
|
---|
52 | }
|
---|
53 | WorkerAddress getNextIdleWorker();
|
---|
54 | bool isWorkerBusy(const WorkerAddress &address) const;
|
---|
55 | bool removeWorker(const WorkerAddress& address);
|
---|
56 | void unmarkWorkerBusy(const WorkerAddress &address);
|
---|
57 |
|
---|
58 | // this is currently for the passing time until Worker pool is fully operable
|
---|
59 |
|
---|
60 | //!> typedef of the priority in the idle queue of a worker
|
---|
61 | typedef size_t priority_t;
|
---|
62 |
|
---|
63 | //!> typedef for the worker queue being a map with priority and address of worker
|
---|
64 | typedef std::multimap<priority_t, WorkerAddress> Idle_Queue_t;
|
---|
65 |
|
---|
66 | // constant iterators on idle queue contents
|
---|
67 | Idle_Queue_t::const_iterator begin_idle() const {
|
---|
68 | return idle_queue.begin();
|
---|
69 | }
|
---|
70 | Idle_Queue_t::const_iterator end_idle() const {
|
---|
71 | return idle_queue.end();
|
---|
72 | }
|
---|
73 |
|
---|
74 | Idle_Queue_t::iterator getIdleWorker(const WorkerAddress &address);
|
---|
75 | void markWorkerBusy(Idle_Queue_t::iterator &iter);
|
---|
76 |
|
---|
77 | bool hasBusyWorkers() const {
|
---|
78 | return (busy_queue.size() != 0);
|
---|
79 | }
|
---|
80 |
|
---|
81 | private:
|
---|
82 | //!> typedef for the worker queue being a map with priority and address of worker
|
---|
83 | typedef std::map<WorkerAddress, priority_t> Busy_Queue_t;
|
---|
84 |
|
---|
85 | //!> typedef for the pool of workers being a set to keep only unique addresses
|
---|
86 | typedef std::set<WorkerAddress> Pool_t;
|
---|
87 |
|
---|
88 | private:
|
---|
89 | //!> FragmentScheduler needs access to removeAllWorkers()
|
---|
90 | friend class FragmentScheduler;
|
---|
91 | void removeAllWorkers();
|
---|
92 |
|
---|
93 | private:
|
---|
94 | //!> static for defining default priority for new workers
|
---|
95 | static priority_t default_priority;
|
---|
96 |
|
---|
97 | //!> empty address in case queue is idle
|
---|
98 | static WorkerAddress emptyAddress;
|
---|
99 |
|
---|
100 | //!> pool of all worker addresses to connect to and work on jobs
|
---|
101 | Pool_t pool;
|
---|
102 |
|
---|
103 | //!> pool of worker addresses to connect to and work on jobs
|
---|
104 | Idle_Queue_t idle_queue;
|
---|
105 |
|
---|
106 | //!> pool of worker addresses to connect to and work on jobs
|
---|
107 | mutable Busy_Queue_t busy_queue;
|
---|
108 | };
|
---|
109 |
|
---|
110 | #endif /* WORKERPOOL_HPP_ */
|
---|