@@ -148,7 +148,7 namespace Implab.Test { | |||
|
148 | 148 | |
|
149 | 149 | [TestMethod] |
|
150 | 150 | public void WorkerPoolSizeTest() { |
|
151 |
var pool = new WorkerPool(5, 10, |
|
|
151 | var pool = new WorkerPool(5, 10, 1); | |
|
152 | 152 | |
|
153 | 153 | Assert.AreEqual(5, pool.PoolSize); |
|
154 | 154 | |
@@ -291,7 +291,7 namespace Implab.Test { | |||
|
291 | 291 | [TestMethod] |
|
292 | 292 | public void ChainedMapTest() { |
|
293 | 293 | |
|
294 |
using (var pool = new WorkerPool(0,10,1 |
|
|
294 | using (var pool = new WorkerPool(0,10,1)) { | |
|
295 | 295 | const int count = 10000; |
|
296 | 296 | |
|
297 | 297 | var args = new double[count]; |
@@ -7,19 +7,15 using System.Diagnostics; | |||
|
7 | 7 | |
|
8 | 8 | namespace Implab.Parallels { |
|
9 | 9 | public abstract class DispatchPool<TUnit> : IDisposable { |
|
10 | readonly int m_minThreads; | |
|
11 | readonly int m_maxThreads; | |
|
12 | readonly int m_releaseTimeout = 100; // the timeout while the working thread will wait for the new tasks before exit | |
|
10 | readonly int m_minThreadsLimit; | |
|
11 | readonly int m_maxThreadsLimit; | |
|
12 | readonly int m_releaseTimeout = 1000; // the timeout while the working thread will wait for the new tasks before exit | |
|
13 | 13 | |
|
14 |
int m_ |
|
|
15 | int m_activeThreads = 0; // the count of threads which are active | |
|
16 | int m_sleepingThreads = 0; // the count of currently inactive threads | |
|
14 | int m_threads = 0; // the current size of the pool | |
|
17 | 15 | int m_maxRunningThreads = 0; // the meximum reached size of the pool |
|
18 |
int m_exit |
|
|
16 | int m_exit = 0; // the pool is going to shutdown, all unused workers are released | |
|
19 | 17 | |
|
20 | int m_wakeEvents = 0; // the count of wake events | |
|
21 | ||
|
22 | readonly object m_signalLocker = new object(); | |
|
18 | readonly object m_signal = new object(); // used to pulse waiting threads | |
|
23 | 19 | |
|
24 | 20 | protected DispatchPool(int min, int max) { |
|
25 | 21 | if (min < 0) |
@@ -29,8 +25,8 namespace Implab.Parallels { | |||
|
29 | 25 | |
|
30 | 26 | if (min > max) |
|
31 | 27 | min = max; |
|
32 | m_minThreads = min; | |
|
33 | m_maxThreads = max; | |
|
28 | m_minThreadsLimit = min; | |
|
29 | m_maxThreadsLimit = max; | |
|
34 | 30 | } |
|
35 | 31 | |
|
36 | 32 | protected DispatchPool(int threads) |
@@ -41,29 +37,22 namespace Implab.Parallels { | |||
|
41 | 37 | int maxThreads, maxCP; |
|
42 | 38 | ThreadPool.GetMaxThreads(out maxThreads, out maxCP); |
|
43 | 39 | |
|
44 | m_minThreads = 0; | |
|
45 | m_maxThreads = maxThreads; | |
|
40 | m_minThreadsLimit = 0; | |
|
41 | m_maxThreadsLimit = maxThreads; | |
|
46 | 42 | } |
|
47 | 43 | |
|
48 | 44 | protected void InitPool() { |
|
49 | for (int i = 0; i < m_minThreads; i++) | |
|
45 | for (int i = 0; i < m_minThreadsLimit; i++) | |
|
50 | 46 | StartWorker(); |
|
51 | 47 | } |
|
52 | 48 | |
|
53 | 49 | public int PoolSize { |
|
54 | 50 | get { |
|
55 | 51 | Thread.MemoryBarrier(); |
|
56 |
return m_ |
|
|
52 | return m_threads; | |
|
57 | 53 | } |
|
58 | 54 | } |
|
59 | ||
|
60 | public int ActiveThreads { | |
|
61 | get { | |
|
62 | Thread.MemoryBarrier(); | |
|
63 | return m_activeThreads; | |
|
64 | } | |
|
65 | } | |
|
66 | ||
|
55 | ||
|
67 | 56 | public int MaxRunningThreads { |
|
68 | 57 | get { |
|
69 | 58 | Thread.MemoryBarrier(); |
@@ -74,150 +63,47 namespace Implab.Parallels { | |||
|
74 | 63 | protected bool IsDisposed { |
|
75 | 64 | get { |
|
76 | 65 | Thread.MemoryBarrier(); |
|
77 |
return m_exit |
|
|
66 | return m_exit == 1; | |
|
78 | 67 | } |
|
79 | 68 | } |
|
80 | 69 | |
|
81 | 70 | protected abstract bool TryDequeue(out TUnit unit); |
|
82 | 71 | |
|
83 | #region thread signaling traits | |
|
84 | int SignalThread() { | |
|
85 | var signals = Interlocked.Increment(ref m_wakeEvents); | |
|
86 | if(signals == 1) | |
|
87 |
|
|
|
88 | Monitor.Pulse(m_signalLocker); | |
|
89 | return signals; | |
|
90 | } | |
|
91 | ||
|
92 | bool FetchSignalOrWait(int timeout) { | |
|
93 | var start = Environment.TickCount; | |
|
94 | int signals; | |
|
95 | Thread.MemoryBarrier(); // m_wakeEvents volatile first read | |
|
96 | do { | |
|
97 | signals = m_wakeEvents; | |
|
98 | if (signals == 0) | |
|
99 | break; | |
|
100 | } while (Interlocked.CompareExchange(ref m_wakeEvents, signals - 1, signals) != signals); | |
|
101 | ||
|
102 | if (signals == 0) { | |
|
103 | // no signal is fetched | |
|
104 | lock(m_signalLocker) { | |
|
105 | while(m_wakeEvents == 0) { | |
|
106 | if (timeout != -1) | |
|
107 | timeout = Math.Max(0, timeout - (Environment.TickCount - start)); | |
|
108 | if(!Monitor.Wait(m_signalLocker,timeout)) | |
|
109 | return false; // timeout | |
|
72 | private bool Dequeue(out TUnit unit, int timeout) { | |
|
73 | int ts = Environment.TickCount; | |
|
74 | if (TryDequeue(out unit)) | |
|
75 | return true; | |
|
76 | lock (m_signal) { | |
|
77 | while (!TryDequeue(out unit) && m_exit == 0) | |
|
78 | if(!Monitor.Wait(m_signal, Math.Max(0, ts + timeout - Environment.TickCount))) { | |
|
79 | // timeout | |
|
80 | return false; | |
|
110 | 81 | } |
|
111 | // m_wakeEvents > 0 | |
|
112 | if (Interlocked.Decrement(ref m_wakeEvents) > 0) //syncronized | |
|
113 | Monitor.Pulse(m_signalLocker); | |
|
114 | ||
|
115 | // signal fetched | |
|
116 | return true; | |
|
117 | } | |
|
118 | ||
|
119 | } else { | |
|
120 | // signal fetched | |
|
121 | return true; | |
|
82 | // queue item or terminate | |
|
83 | Monitor.Pulse(m_signal); | |
|
84 | if (m_exit == 1) | |
|
85 | return false; | |
|
122 | 86 | } |
|
123 | ||
|
124 | ||
|
87 | return true; | |
|
125 | 88 | } |
|
126 | 89 | |
|
127 | bool Sleep(int timeout) { | |
|
128 | Interlocked.Increment(ref m_sleepingThreads); | |
|
129 | if (FetchSignalOrWait(timeout)) { | |
|
130 | Interlocked.Decrement(ref m_sleepingThreads); | |
|
131 | return true; | |
|
132 | } else { | |
|
133 | Interlocked.Decrement(ref m_sleepingThreads); | |
|
134 | return false; | |
|
135 | } | |
|
136 | } | |
|
137 | #endregion | |
|
138 | ||
|
139 | /// <summary> | |
|
140 | /// Запускает либо новый поток, если раньше не было ни одного потока, либо устанавливает событие пробуждение одного спящего потока | |
|
141 | /// </summary> | |
|
142 | protected void GrowPool() { | |
|
143 | Thread.MemoryBarrier(); | |
|
144 | if (m_exitRequired == 1) | |
|
145 | return; | |
|
146 | if (m_sleepingThreads > m_wakeEvents) { | |
|
147 | //Console.WriteLine("Waking threads (sleeps {0}, pending {1})", m_sleepingThreads, m_wakeEvents); | |
|
148 | ||
|
149 | // all sleeping threads may gone | |
|
150 | SignalThread(); // wake a sleeping thread; | |
|
151 | ||
|
152 | // we can't check whether signal has been processed | |
|
153 | // anyway it may take some time for the thread to start | |
|
154 | // we will ensure that at least one thread is running | |
|
155 | ||
|
156 | EnsurePoolIsAlive(); | |
|
157 | } else { | |
|
158 | // if there is no sleeping threads in the pool | |
|
159 | if (!StartWorker()) { | |
|
160 | // we haven't started a new thread, but the current can be on the way to terminate and it can't process the queue | |
|
161 | // send it a signal to spin again | |
|
162 | SignalThread(); | |
|
163 | EnsurePoolIsAlive(); | |
|
164 | } | |
|
90 | protected void SignalThread() { | |
|
91 | lock (m_signal) { | |
|
92 | Monitor.Pulse(m_signal); | |
|
165 | 93 | } |
|
166 | 94 | } |
|
167 | 95 | |
|
168 | protected void EnsurePoolIsAlive() { | |
|
169 | if (AllocateThreadSlot(1)) { | |
|
170 | // if there were no threads in the pool | |
|
171 | var worker = new Thread(this.Worker); | |
|
172 | worker.IsBackground = true; | |
|
173 | worker.Start(); | |
|
174 | } | |
|
175 | } | |
|
176 | ||
|
177 | protected virtual bool Suspend() { | |
|
178 | //no tasks left, exit if the thread is no longer needed | |
|
179 | bool last; | |
|
180 | bool requestExit; | |
|
181 | ||
|
182 | // if threads have a timeout before releasing | |
|
183 | if (m_releaseTimeout > 0) | |
|
184 | requestExit = !Sleep(m_releaseTimeout); | |
|
185 | else | |
|
186 | requestExit = true; | |
|
187 | ||
|
188 | if (!requestExit) | |
|
189 | return true; | |
|
190 | ||
|
191 | // release unsused thread | |
|
192 | if (requestExit && ReleaseThreadSlot(out last)) { | |
|
193 | // in case at the moment the last thread was being released | |
|
194 | // a new task was added to the queue, we need to try | |
|
195 | // to revoke the thread to avoid the situation when the task is left unprocessed | |
|
196 | if (last && FetchSignalOrWait(0)) { // FetchSignalOrWait(0) will fetch pending task or will return false | |
|
197 | SignalThread(); // since FetchSignalOrWait(0) has fetched the signal we need to reschedule it | |
|
198 | return AllocateThreadSlot(1); // ensure that at least one thread is alive | |
|
199 | } | |
|
200 | ||
|
201 | return false; | |
|
202 | } | |
|
203 | ||
|
204 | // wait till infinity | |
|
205 | Sleep(-1); | |
|
206 | ||
|
207 | return true; | |
|
208 | } | |
|
209 | ||
|
210 | 96 | #region thread slots traits |
|
211 | 97 | |
|
212 | 98 | bool AllocateThreadSlot() { |
|
213 | 99 | int current; |
|
214 | 100 | // use spins to allocate slot for the new thread |
|
215 | 101 | do { |
|
216 |
current = m_ |
|
|
217 |
if (current >= m_maxThreads || m_exit |
|
|
102 | current = m_threads; | |
|
103 | if (current >= m_maxThreadsLimit || m_exit == 1) | |
|
218 | 104 | // no more slots left or the pool has been disposed |
|
219 | 105 | return false; |
|
220 |
} while (current != Interlocked.CompareExchange(ref m_ |
|
|
106 | } while (current != Interlocked.CompareExchange(ref m_threads, current + 1, current)); | |
|
221 | 107 | |
|
222 | 108 | UpdateMaxThreads(current + 1); |
|
223 | 109 | |
@@ -225,7 +111,7 namespace Implab.Parallels { | |||
|
225 | 111 | } |
|
226 | 112 | |
|
227 | 113 | bool AllocateThreadSlot(int desired) { |
|
228 |
if (desired - 1 != Interlocked.CompareExchange(ref m_ |
|
|
114 | if (desired - 1 != Interlocked.CompareExchange(ref m_threads, desired, desired - 1)) | |
|
229 | 115 | return false; |
|
230 | 116 | |
|
231 | 117 | UpdateMaxThreads(desired); |
@@ -239,26 +125,17 namespace Implab.Parallels { | |||
|
239 | 125 | // use spins to release slot for the new thread |
|
240 | 126 | Thread.MemoryBarrier(); |
|
241 | 127 | do { |
|
242 |
current = m_ |
|
|
243 |
if (current <= m_minThreads && m_exit |
|
|
128 | current = m_threads; | |
|
129 | if (current <= m_minThreadsLimit && m_exit == 0) | |
|
244 | 130 | // the thread is reserved |
|
245 | 131 | return false; |
|
246 |
} while (current != Interlocked.CompareExchange(ref m_ |
|
|
132 | } while (current != Interlocked.CompareExchange(ref m_threads, current - 1, current)); | |
|
247 | 133 | |
|
248 | 134 | last = (current == 1); |
|
249 | 135 | |
|
250 | 136 | return true; |
|
251 | 137 | } |
|
252 | 138 | |
|
253 | /// <summary> | |
|
254 | /// releases thread slot unconditionally, used during cleanup | |
|
255 | /// </summary> | |
|
256 | /// <returns>true - no more threads left</returns> | |
|
257 | bool ReleaseThreadSlotAnyway() { | |
|
258 | var left = Interlocked.Decrement(ref m_createdThreads); | |
|
259 | return left == 0; | |
|
260 | } | |
|
261 | ||
|
262 | 139 | void UpdateMaxThreads(int count) { |
|
263 | 140 | int max; |
|
264 | 141 | do { |
@@ -270,12 +147,11 namespace Implab.Parallels { | |||
|
270 | 147 | |
|
271 | 148 | #endregion |
|
272 | 149 | |
|
273 | bool StartWorker() { | |
|
150 | protected bool StartWorker() { | |
|
274 | 151 | if (AllocateThreadSlot()) { |
|
275 | 152 | // slot successfully allocated |
|
276 | 153 | var worker = new Thread(this.Worker); |
|
277 | 154 | worker.IsBackground = true; |
|
278 | Interlocked.Increment(ref m_activeThreads); | |
|
279 | 155 | worker.Start(); |
|
280 | 156 | |
|
281 | 157 | return true; |
@@ -288,45 +164,30 namespace Implab.Parallels { | |||
|
288 | 164 | |
|
289 | 165 | protected virtual void Worker() { |
|
290 | 166 | TUnit unit; |
|
291 | //Console.WriteLine("{0}: Active", Thread.CurrentThread.ManagedThreadId); | |
|
292 | int count = 0;; | |
|
293 | Thread.MemoryBarrier(); | |
|
167 | bool last; | |
|
294 | 168 | do { |
|
295 | // exit if requested | |
|
296 | if (m_exitRequired == 1) { | |
|
297 | // release the thread slot | |
|
298 | Interlocked.Decrement(ref m_activeThreads); | |
|
299 | if (!ReleaseThreadSlotAnyway()) // it was the last worker | |
|
300 | SignalThread(); // wake next worker | |
|
301 | break; | |
|
302 | } | |
|
303 | ||
|
304 | // fetch task | |
|
305 | if (TryDequeue(out unit)) { | |
|
169 | while (Dequeue(out unit, m_releaseTimeout)) { | |
|
306 | 170 | InvokeUnit(unit); |
|
307 |
|
|
|
171 | } | |
|
172 | if(!ReleaseThreadSlot(out last)) | |
|
308 | 173 | continue; |
|
174 | // queue may be not empty | |
|
175 | if (last && TryDequeue(out unit)) { | |
|
176 | InvokeUnit(unit); | |
|
177 | if (AllocateThreadSlot(1)) | |
|
178 | continue; | |
|
179 | // we can safely exit since pool is alive | |
|
309 | 180 | } |
|
310 | Interlocked.Decrement(ref m_activeThreads); | |
|
181 | break; | |
|
182 | } while(true); | |
|
183 | } | |
|
311 | 184 | |
|
312 | Console.WriteLine("{0}: Suspend processed({1})", Thread.CurrentThread.ManagedThreadId,count); | |
|
313 | // entering suspend state | |
|
314 | // keep this thread and wait | |
|
315 | if (!Suspend()) | |
|
316 | break; | |
|
317 | count = 0; | |
|
318 | //Console.WriteLine("{0}: Awake", Thread.CurrentThread.ManagedThreadId); | |
|
319 | Interlocked.Increment(ref m_activeThreads); | |
|
320 | } while (true); | |
|
321 | //Console.WriteLine("{0}: Exited", Thread.CurrentThread.ManagedThreadId); | |
|
322 | } | |
|
323 | 185 | |
|
324 | 186 | protected virtual void Dispose(bool disposing) { |
|
325 | 187 | if (disposing) { |
|
326 |
if (0 == Interlocked.CompareExchange(ref m_exit |
|
|
188 | if (0 == Interlocked.CompareExchange(ref m_exit, 1, 0)) { // implies memory barrier | |
|
327 | 189 | // wake sleeping threads |
|
328 |
|
|
|
329 | SignalThread(); | |
|
190 | SignalThread(); | |
|
330 | 191 | GC.SuppressFinalize(this); |
|
331 | 192 | } |
|
332 | 193 | } |
@@ -66,10 +66,11 namespace Implab.Parallels { | |||
|
66 | 66 | var len = Interlocked.Increment(ref m_queueLength); |
|
67 | 67 | m_queue.Enqueue(unit); |
|
68 | 68 | |
|
69 |
if (len > m_threshold * |
|
|
70 |
|
|
|
71 | GrowPool(); | |
|
69 | if (len > m_threshold * PoolSize) { | |
|
70 | StartWorker(); | |
|
72 | 71 | } |
|
72 | ||
|
73 | SignalThread(); | |
|
73 | 74 | } |
|
74 | 75 | |
|
75 | 76 | protected override bool TryDequeue(out Action unit) { |
@@ -80,24 +81,6 namespace Implab.Parallels { | |||
|
80 | 81 | return false; |
|
81 | 82 | } |
|
82 | 83 | |
|
83 | protected override bool Suspend() { | |
|
84 | // This override solves race condition | |
|
85 | // WORKER CLIENT | |
|
86 | // --------------------------------------- | |
|
87 | // TryDeque == false | |
|
88 | // Enqueue(unit), queueLen++ | |
|
89 | // GrowPool? == NO | |
|
90 | // ActiveThreads-- | |
|
91 | // Suspend | |
|
92 | // queueLength > 0 | |
|
93 | // continue | |
|
94 | Thread.MemoryBarrier(); | |
|
95 | if (m_queueLength > 0) | |
|
96 | return true; | |
|
97 | Interlocked.Decrement(ref m_workers); | |
|
98 | return base.Suspend(); | |
|
99 | } | |
|
100 | ||
|
101 | 84 | protected override void InvokeUnit(Action unit) { |
|
102 | 85 | unit(); |
|
103 | 86 | } |
General Comments 0
You need to be logged in to leave comments.
Login now