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