1 |
|
/* |
2 |
– |
* @test |
3 |
– |
* @synopsis multiple producers and consumers using blocking queues |
4 |
– |
*/ |
5 |
– |
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
< |
* Expert Group and released to the public domain. Use, modify, and |
4 |
< |
* redistribute this code in any way without acknowledgement. |
3 |
> |
* Expert Group and released to the public domain, as explained at |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import java.util.concurrent.*; |
7 |
> |
import java.util.Random; |
8 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
9 |
> |
import java.util.concurrent.BlockingQueue; |
10 |
> |
import java.util.concurrent.CyclicBarrier; |
11 |
> |
import java.util.concurrent.ExecutorService; |
12 |
> |
import java.util.concurrent.Executors; |
13 |
> |
import java.util.concurrent.LinkedBlockingDeque; |
14 |
> |
import java.util.concurrent.LinkedBlockingQueue; |
15 |
> |
import java.util.concurrent.LinkedTransferQueue; |
16 |
> |
import java.util.concurrent.Phaser; |
17 |
> |
import java.util.concurrent.PriorityBlockingQueue; |
18 |
> |
import java.util.concurrent.SynchronousQueue; |
19 |
|
|
20 |
|
public class ProducerConsumerLoops { |
21 |
< |
static final int CAPACITY = 100; |
22 |
< |
|
21 |
> |
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
22 |
> |
static final Random rng = new Random(); |
23 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
24 |
|
static boolean print = false; |
25 |
|
static int producerSum; |
37 |
|
throw new Error("CheckSum mismatch"); |
38 |
|
} |
39 |
|
|
40 |
+ |
// Number of elements passed around -- must be power of two |
41 |
+ |
// Elements are reused from pool to minimize alloc impact |
42 |
+ |
static final int POOL_SIZE = 1 << 7; |
43 |
+ |
static final int POOL_MASK = POOL_SIZE-1; |
44 |
+ |
static final Integer[] intPool = new Integer[POOL_SIZE]; |
45 |
+ |
static { |
46 |
+ |
for (int i = 0; i < POOL_SIZE; ++i) |
47 |
+ |
intPool[i] = Integer.valueOf(i); |
48 |
+ |
} |
49 |
+ |
|
50 |
+ |
// Number of puts by producers or takes by consumers |
51 |
+ |
static final int ITERS = 1 << 20; |
52 |
+ |
|
53 |
+ |
// max lag between a producer and consumer to avoid |
54 |
+ |
// this becoming a GC test rather than queue test. |
55 |
+ |
// Used only per-pair to lessen impact on queue sync |
56 |
+ |
static final int LAG_MASK = (1 << 12) - 1; |
57 |
+ |
|
58 |
|
public static void main(String[] args) throws Exception { |
59 |
< |
int maxPairs = 100; |
35 |
< |
int iters = 100000; |
59 |
> |
int maxPairs = NCPUS * 3 / 2; |
60 |
|
|
61 |
< |
if (args.length > 0) |
61 |
> |
if (args.length > 0) |
62 |
|
maxPairs = Integer.parseInt(args[0]); |
63 |
|
|
64 |
< |
print = false; |
41 |
< |
System.out.println("Warmup..."); |
42 |
< |
oneTest(1, 10000); |
43 |
< |
Thread.sleep(100); |
44 |
< |
oneTest(2, 10000); |
45 |
< |
Thread.sleep(100); |
46 |
< |
oneTest(2, 10000); |
47 |
< |
Thread.sleep(100); |
64 |
> |
warmup(); |
65 |
|
print = true; |
66 |
< |
|
50 |
< |
int k = 1; |
51 |
< |
for (int i = 1; i <= maxPairs;) { |
66 |
> |
for (int k = 1, i = 1; i <= maxPairs;) { |
67 |
|
System.out.println("Pairs:" + i); |
68 |
< |
oneTest(i, iters); |
54 |
< |
Thread.sleep(100); |
68 |
> |
oneTest(i, ITERS); |
69 |
|
if (i == k) { |
70 |
|
k = i << 1; |
71 |
|
i = i + (i >>> 1); |
72 |
< |
} |
73 |
< |
else |
72 |
> |
} |
73 |
> |
else |
74 |
|
i = k; |
75 |
|
} |
76 |
|
pool.shutdown(); |
77 |
< |
} |
77 |
> |
} |
78 |
|
|
79 |
< |
static void oneTest(int pairs, int iters) throws Exception { |
80 |
< |
int fairIters = iters/20; |
79 |
> |
static void warmup() throws Exception { |
80 |
> |
print = false; |
81 |
> |
System.out.print("Warmup "); |
82 |
> |
int it = 2000; |
83 |
> |
for (int j = 5; j > 0; --j) { |
84 |
> |
oneTest(j, it); |
85 |
> |
System.out.print("."); |
86 |
> |
it += 1000; |
87 |
> |
} |
88 |
> |
System.gc(); |
89 |
> |
it = 20000; |
90 |
> |
for (int j = 5; j > 0; --j) { |
91 |
> |
oneTest(j, it); |
92 |
> |
System.out.print("."); |
93 |
> |
it += 10000; |
94 |
> |
} |
95 |
> |
System.gc(); |
96 |
> |
System.out.println(); |
97 |
> |
} |
98 |
> |
|
99 |
> |
static void oneTest(int n, int iters) throws Exception { |
100 |
> |
int fairIters = iters/16; |
101 |
> |
|
102 |
> |
Thread.sleep(100); // System.gc(); |
103 |
|
if (print) |
104 |
< |
System.out.print("ArrayBlockingQueue "); |
105 |
< |
oneRun(new ArrayBlockingQueue<Integer>(CAPACITY), pairs, iters); |
104 |
> |
System.out.print("LinkedTransferQueue "); |
105 |
> |
oneRun(new LinkedTransferQueue<Integer>(), n, iters); |
106 |
|
|
107 |
+ |
Thread.sleep(100); // System.gc(); |
108 |
|
if (print) |
109 |
|
System.out.print("LinkedBlockingQueue "); |
110 |
< |
oneRun(new LinkedBlockingQueue<Integer>(CAPACITY), pairs, iters); |
110 |
> |
oneRun(new LinkedBlockingQueue<Integer>(), n, iters); |
111 |
|
|
112 |
+ |
Thread.sleep(100); // System.gc(); |
113 |
+ |
if (print) |
114 |
+ |
System.out.print("LinkedBlockingQueue(cap)"); |
115 |
+ |
oneRun(new LinkedBlockingQueue<Integer>(POOL_SIZE), n, iters); |
116 |
+ |
|
117 |
+ |
Thread.sleep(100); // System.gc(); |
118 |
|
if (print) |
119 |
|
System.out.print("LinkedBlockingDeque "); |
120 |
< |
oneRun(new LinkedBlockingDeque<Integer>(CAPACITY), pairs, iters); |
120 |
> |
oneRun(new LinkedBlockingDeque<Integer>(), n, iters); |
121 |
|
|
122 |
+ |
Thread.sleep(100); // System.gc(); |
123 |
+ |
if (print) |
124 |
+ |
System.out.print("ArrayBlockingQueue "); |
125 |
+ |
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters); |
126 |
+ |
|
127 |
+ |
Thread.sleep(100); // System.gc(); |
128 |
|
if (print) |
129 |
|
System.out.print("SynchronousQueue "); |
130 |
< |
oneRun(new SynchronousQueue<Integer>(), pairs, iters); |
130 |
> |
oneRun(new SynchronousQueue<Integer>(), n, iters); |
131 |
|
|
132 |
+ |
Thread.sleep(100); // System.gc(); |
133 |
|
if (print) |
134 |
|
System.out.print("SynchronousQueue(fair) "); |
135 |
< |
oneRun(new SynchronousQueue<Integer>(true), pairs, fairIters); |
135 |
> |
oneRun(new SynchronousQueue<Integer>(true), n, iters); |
136 |
|
|
137 |
+ |
Thread.sleep(100); // System.gc(); |
138 |
+ |
if (print) |
139 |
+ |
System.out.print("LinkedTransferQueue(xfer)"); |
140 |
+ |
oneRun(new LTQasSQ<Integer>(), n, iters); |
141 |
+ |
|
142 |
+ |
Thread.sleep(100); // System.gc(); |
143 |
+ |
if (print) |
144 |
+ |
System.out.print("LinkedTransferQueue(half)"); |
145 |
+ |
oneRun(new HalfSyncLTQ<Integer>(), n, iters); |
146 |
+ |
|
147 |
+ |
Thread.sleep(100); // System.gc(); |
148 |
|
if (print) |
149 |
|
System.out.print("PriorityBlockingQueue "); |
150 |
< |
oneRun(new PriorityBlockingQueue<Integer>(), pairs, fairIters); |
150 |
> |
oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters); |
151 |
|
|
152 |
+ |
Thread.sleep(100); // System.gc(); |
153 |
|
if (print) |
154 |
|
System.out.print("ArrayBlockingQueue(fair)"); |
155 |
< |
oneRun(new ArrayBlockingQueue<Integer>(CAPACITY, true), pairs, fairIters); |
94 |
< |
|
155 |
> |
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters); |
156 |
|
} |
157 |
< |
|
158 |
< |
static abstract class Stage implements Runnable { |
157 |
> |
|
158 |
> |
abstract static class Stage implements Runnable { |
159 |
|
final int iters; |
160 |
|
final BlockingQueue<Integer> queue; |
161 |
|
final CyclicBarrier barrier; |
162 |
< |
Stage (BlockingQueue<Integer> q, CyclicBarrier b, int iters) { |
163 |
< |
queue = q; |
162 |
> |
final Phaser lagPhaser; |
163 |
> |
Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) { |
164 |
> |
queue = q; |
165 |
|
barrier = b; |
166 |
+ |
lagPhaser = s; |
167 |
|
this.iters = iters; |
168 |
|
} |
169 |
|
} |
170 |
|
|
171 |
|
static class Producer extends Stage { |
172 |
< |
Producer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) { |
173 |
< |
super(q, b, iters); |
172 |
> |
Producer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
173 |
> |
int iters) { |
174 |
> |
super(q, b, s, iters); |
175 |
|
} |
176 |
|
|
177 |
|
public void run() { |
178 |
|
try { |
179 |
|
barrier.await(); |
180 |
< |
int s = 0; |
181 |
< |
int l = hashCode(); |
180 |
> |
int ps = 0; |
181 |
> |
int r = hashCode(); |
182 |
|
for (int i = 0; i < iters; ++i) { |
183 |
< |
l = LoopHelpers.compute4(l); |
184 |
< |
queue.put(new Integer(l)); |
185 |
< |
s += LoopHelpers.compute4(l); |
183 |
> |
r = LoopHelpers.compute7(r); |
184 |
> |
Integer v = intPool[r & POOL_MASK]; |
185 |
> |
int k = v.intValue(); |
186 |
> |
queue.put(v); |
187 |
> |
ps += k; |
188 |
> |
if ((i & LAG_MASK) == LAG_MASK) |
189 |
> |
lagPhaser.arriveAndAwaitAdvance(); |
190 |
|
} |
191 |
< |
addProducerSum(s); |
191 |
> |
addProducerSum(ps); |
192 |
|
barrier.await(); |
193 |
|
} |
194 |
< |
catch (Exception ie) { |
195 |
< |
ie.printStackTrace(); |
196 |
< |
return; |
194 |
> |
catch (Exception ie) { |
195 |
> |
ie.printStackTrace(); |
196 |
> |
return; |
197 |
|
} |
198 |
|
} |
199 |
|
} |
200 |
|
|
201 |
|
static class Consumer extends Stage { |
202 |
< |
Consumer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) { |
203 |
< |
super(q, b, iters); |
202 |
> |
Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
203 |
> |
int iters) { |
204 |
> |
super(q, b, s, iters); |
205 |
|
} |
206 |
|
|
207 |
|
public void run() { |
208 |
|
try { |
209 |
|
barrier.await(); |
210 |
< |
int l = 0; |
142 |
< |
int s = 0; |
210 |
> |
int cs = 0; |
211 |
|
for (int i = 0; i < iters; ++i) { |
212 |
< |
l = LoopHelpers.compute4(queue.take().intValue()); |
213 |
< |
s += l; |
212 |
> |
Integer v = queue.take(); |
213 |
> |
int k = v.intValue(); |
214 |
> |
cs += k; |
215 |
> |
if ((i & LAG_MASK) == LAG_MASK) |
216 |
> |
lagPhaser.arriveAndAwaitAdvance(); |
217 |
|
} |
218 |
< |
addConsumerSum(s); |
218 |
> |
addConsumerSum(cs); |
219 |
|
barrier.await(); |
220 |
|
} |
221 |
< |
catch (Exception ie) { |
222 |
< |
ie.printStackTrace(); |
223 |
< |
return; |
221 |
> |
catch (Exception ie) { |
222 |
> |
ie.printStackTrace(); |
223 |
> |
return; |
224 |
|
} |
225 |
|
} |
226 |
|
|
227 |
|
} |
228 |
|
|
229 |
< |
static void oneRun(BlockingQueue<Integer> q, int npairs, int iters) throws Exception { |
229 |
> |
static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception { |
230 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
231 |
< |
CyclicBarrier barrier = new CyclicBarrier(npairs * 2 + 1, timer); |
232 |
< |
for (int i = 0; i < npairs; ++i) { |
233 |
< |
pool.execute(new Producer(q, barrier, iters)); |
234 |
< |
pool.execute(new Consumer(q, barrier, iters)); |
231 |
> |
CyclicBarrier barrier = new CyclicBarrier(n * 2 + 1, timer); |
232 |
> |
for (int i = 0; i < n; ++i) { |
233 |
> |
Phaser s = new Phaser(2); |
234 |
> |
pool.execute(new Producer(q, barrier, s, iters)); |
235 |
> |
pool.execute(new Consumer(q, barrier, s, iters)); |
236 |
|
} |
237 |
|
barrier.await(); |
238 |
|
barrier.await(); |
239 |
|
long time = timer.getTime(); |
240 |
|
checkSum(); |
241 |
|
if (print) |
242 |
< |
System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * npairs)) + " ns per transfer"); |
242 |
> |
System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer"); |
243 |
> |
} |
244 |
> |
|
245 |
> |
static final class LTQasSQ<T> extends LinkedTransferQueue<T> { |
246 |
> |
LTQasSQ() { super(); } |
247 |
> |
public void put(T x) { |
248 |
> |
try { super.transfer(x); |
249 |
> |
} catch (InterruptedException ex) { throw new Error(); } |
250 |
> |
} |
251 |
|
} |
252 |
|
|
253 |
+ |
static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> { |
254 |
+ |
int calls; |
255 |
+ |
HalfSyncLTQ() { super(); } |
256 |
+ |
public void put(T x) { |
257 |
+ |
if ((++calls & 1) == 0) |
258 |
+ |
super.put(x); |
259 |
+ |
else { |
260 |
+ |
try { super.transfer(x); |
261 |
+ |
} catch (InterruptedException ex) { |
262 |
+ |
throw new Error(); |
263 |
+ |
} |
264 |
+ |
} |
265 |
+ |
} |
266 |
+ |
} |
267 |
|
} |