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/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import java.util.*; |
8 |
< |
import java.util.concurrent.*; |
9 |
< |
//import jsr166y.*; |
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 MultipleProducersSingleConsumerLoops { |
21 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
13 |
– |
static final Random rng = new Random(); |
22 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
23 |
|
static boolean print = false; |
24 |
|
static int producerSum; |
42 |
|
static final int POOL_MASK = POOL_SIZE-1; |
43 |
|
static final Integer[] intPool = new Integer[POOL_SIZE]; |
44 |
|
static { |
45 |
< |
for (int i = 0; i < POOL_SIZE; ++i) |
45 |
> |
for (int i = 0; i < POOL_SIZE; ++i) |
46 |
|
intPool[i] = Integer.valueOf(i); |
47 |
|
} |
48 |
|
|
49 |
|
// Number of puts by producers or takes by consumers |
50 |
|
static final int ITERS = 1 << 20; |
51 |
|
|
52 |
< |
// max lag between a producer and consumer to avoid |
52 |
> |
// max lag between a producer and consumer to avoid |
53 |
|
// this becoming a GC test rather than queue test. |
54 |
|
static final int LAG = (1 << 12); |
55 |
|
static final int LAG_MASK = LAG - 1; |
57 |
|
public static void main(String[] args) throws Exception { |
58 |
|
int maxn = 12; // NCPUS * 3 / 2; |
59 |
|
|
60 |
< |
if (args.length > 0) |
60 |
> |
if (args.length > 0) |
61 |
|
maxn = Integer.parseInt(args[0]); |
62 |
|
|
63 |
|
warmup(); |
64 |
|
print = true; |
65 |
< |
int k = 1; |
58 |
< |
for (int i = 1; i <= maxn;) { |
65 |
> |
for (int k = 1, i = 1; i <= maxn;) { |
66 |
|
System.out.println("Producers:" + i); |
67 |
|
oneTest(i, ITERS); |
68 |
|
if (i == k) { |
69 |
|
k = i << 1; |
70 |
|
i = i + (i >>> 1); |
71 |
< |
} |
72 |
< |
else |
71 |
> |
} |
72 |
> |
else |
73 |
|
i = k; |
74 |
|
} |
75 |
|
pool.shutdown(); |
80 |
|
System.out.print("Warmup "); |
81 |
|
int it = 2000; |
82 |
|
for (int j = 5; j > 0; --j) { |
83 |
< |
oneTest(j, it); |
83 |
> |
oneTest(j, it); |
84 |
|
System.out.print("."); |
85 |
|
it += 1000; |
86 |
|
} |
87 |
|
System.gc(); |
88 |
|
it = 20000; |
89 |
|
for (int j = 5; j > 0; --j) { |
90 |
< |
oneTest(j, it); |
90 |
> |
oneTest(j, it); |
91 |
|
System.out.print("."); |
92 |
|
it += 10000; |
93 |
|
} |
117 |
|
if (print) |
118 |
|
System.out.print("LinkedBlockingDeque "); |
119 |
|
oneRun(new LinkedBlockingDeque<Integer>(), n, iters); |
120 |
< |
|
120 |
> |
|
121 |
|
Thread.sleep(100); // System.gc(); |
122 |
|
if (print) |
123 |
|
System.out.print("ArrayBlockingQueue "); |
128 |
|
System.out.print("SynchronousQueue "); |
129 |
|
oneRun(new SynchronousQueue<Integer>(), n, iters); |
130 |
|
|
124 |
– |
|
131 |
|
Thread.sleep(100); // System.gc(); |
132 |
|
if (print) |
133 |
|
System.out.print("SynchronousQueue(fair) "); |
142 |
|
if (print) |
143 |
|
System.out.print("LinkedTransferQueue(half)"); |
144 |
|
oneRun(new HalfSyncLTQ<Integer>(), n, iters); |
145 |
< |
|
145 |
> |
|
146 |
|
Thread.sleep(100); // System.gc(); |
147 |
|
if (print) |
148 |
|
System.out.print("PriorityBlockingQueue "); |
152 |
|
if (print) |
153 |
|
System.out.print("ArrayBlockingQueue(fair)"); |
154 |
|
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters); |
149 |
– |
|
150 |
– |
|
155 |
|
} |
156 |
< |
|
157 |
< |
static abstract class Stage implements Runnable { |
156 |
> |
|
157 |
> |
abstract static class Stage implements Runnable { |
158 |
|
final int iters; |
159 |
|
final BlockingQueue<Integer> queue; |
160 |
|
final CyclicBarrier barrier; |
161 |
|
final Phaser lagPhaser; |
162 |
|
final int lag; |
163 |
< |
Stage (BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
164 |
< |
int iters, int lag) { |
165 |
< |
queue = q; |
163 |
> |
Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
164 |
> |
int iters, int lag) { |
165 |
> |
queue = q; |
166 |
|
barrier = b; |
167 |
|
lagPhaser = s; |
168 |
|
this.iters = iters; |
196 |
|
addProducerSum(ps); |
197 |
|
barrier.await(); |
198 |
|
} |
199 |
< |
catch (Exception ie) { |
200 |
< |
ie.printStackTrace(); |
201 |
< |
return; |
199 |
> |
catch (Exception ie) { |
200 |
> |
ie.printStackTrace(); |
201 |
> |
return; |
202 |
|
} |
203 |
|
} |
204 |
|
} |
205 |
|
|
206 |
|
static class Consumer extends Stage { |
207 |
|
Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
208 |
< |
int iters, int lag) { |
208 |
> |
int iters, int lag) { |
209 |
|
super(q, b, s, iters, lag); |
210 |
|
} |
211 |
|
|
226 |
|
addConsumerSum(cs); |
227 |
|
barrier.await(); |
228 |
|
} |
229 |
< |
catch (Exception ie) { |
230 |
< |
ie.printStackTrace(); |
231 |
< |
return; |
229 |
> |
catch (Exception ie) { |
230 |
> |
ie.printStackTrace(); |
231 |
> |
return; |
232 |
|
} |
233 |
|
} |
234 |
|
|
235 |
|
} |
236 |
|
|
233 |
– |
|
237 |
|
static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception { |
238 |
|
|
239 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
250 |
|
if (print) |
251 |
|
System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * (n + 1))) + " ns per transfer"); |
252 |
|
} |
253 |
< |
|
253 |
> |
|
254 |
|
static final class LTQasSQ<T> extends LinkedTransferQueue<T> { |
255 |
|
LTQasSQ() { super(); } |
256 |
|
public void put(T x) { |
257 |
< |
try { super.transfer(x); |
257 |
> |
try { super.transfer(x); |
258 |
|
} catch (InterruptedException ex) { throw new Error(); } |
259 |
|
} |
260 |
|
} |
266 |
|
if ((++calls & 1) == 0) |
267 |
|
super.put(x); |
268 |
|
else { |
269 |
< |
try { super.transfer(x); |
270 |
< |
} catch (InterruptedException ex) { |
271 |
< |
throw new Error(); |
269 |
> |
try { super.transfer(x); |
270 |
> |
} catch (InterruptedException ex) { |
271 |
> |
throw new Error(); |
272 |
|
} |
273 |
|
} |
274 |
|
} |
275 |
|
} |
276 |
|
} |
274 |
– |
|