ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/loops/MultipleProducersSingleConsumerLoops.java

Comparing jsr166/src/test/loops/MultipleProducersSingleConsumerLoops.java (file contents):
Revision 1.4 by dl, Fri Oct 23 19:57:06 2009 UTC vs.
Revision 1.10 by jsr166, Thu Jan 15 18:34:19 2015 UTC

#	Line 1 | Line 1
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.*;
#	Line 34 | Line 34 | public class MultipleProducersSingleCons
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)
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
44	>	// max lag between a producer and consumer to avoid
45		// this becoming a GC test rather than queue test.
46		static final int LAG = (1 << 12);
47		static final int LAG_MASK = LAG - 1;
#	Line 49 | Line 49 | public class MultipleProducersSingleCons
49		public static void main(String[] args) throws Exception {
50		int maxn = 12; // NCPUS * 3 / 2;
51
52	<	if (args.length > 0)
52	>	if (args.length > 0)
53		maxn = Integer.parseInt(args[0]);
54
55		warmup();
56		print = true;
57	<	int k = 1;
58	<	for (int i = 1; i <= maxn;) {
57	>	for (int k = 1, i = 1; i <= maxn;) {
58		System.out.println("Producers:" + i);
59		oneTest(i, ITERS);
60		if (i == k) {
61		k = i << 1;
62		i = i + (i >>> 1);
63	<	}
64	<	else
63	>	}
64	>	else
65		i = k;
66		}
67		pool.shutdown();
#	Line 73 | Line 72 | public class MultipleProducersSingleCons
72		System.out.print("Warmup ");
73		int it = 2000;
74		for (int j = 5; j > 0; --j) {
75	<	oneTest(j, it);
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);
82	>	oneTest(j, it);
83		System.out.print(".");
84		it += 10000;
85		}
#	Line 110 | Line 109 | public class MultipleProducersSingleCons
109		if (print)
110		System.out.print("LinkedBlockingDeque     ");
111		oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
112	<
112	>
113		Thread.sleep(100); // System.gc();
114		if (print)
115		System.out.print("ArrayBlockingQueue      ");
#	Line 121 | Line 120 | public class MultipleProducersSingleCons
120		System.out.print("SynchronousQueue        ");
121		oneRun(new SynchronousQueue<Integer>(), n, iters);
122
124	–
123		Thread.sleep(100); // System.gc();
124		if (print)
125		System.out.print("SynchronousQueue(fair)  ");
#	Line 136 | Line 134 | public class MultipleProducersSingleCons
134		if (print)
135		System.out.print("LinkedTransferQueue(half)");
136		oneRun(new HalfSyncLTQ<Integer>(), n, iters);
137	<
137	>
138		Thread.sleep(100); // System.gc();
139		if (print)
140		System.out.print("PriorityBlockingQueue   ");
#	Line 147 | Line 145 | public class MultipleProducersSingleCons
145		System.out.print("ArrayBlockingQueue(fair)");
146		oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
147
150	–
148		}
149	<
150	<	static abstract class Stage implements Runnable {
149	>
150	>	abstract static class Stage implements Runnable {
151		final int iters;
152		final BlockingQueue<Integer> queue;
153		final CyclicBarrier barrier;
154		final Phaser lagPhaser;
155		final int lag;
156	<	Stage (BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
157	<	int iters, int lag) {
158	<	queue = q;
156	>	Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
157	>	int iters, int lag) {
158	>	queue = q;
159		barrier = b;
160		lagPhaser = s;
161		this.iters = iters;
#	Line 192 | Line 189 | public class MultipleProducersSingleCons
189		addProducerSum(ps);
190		barrier.await();
191		}
192	<	catch (Exception ie) {
193	<	ie.printStackTrace();
194	<	return;
192	>	catch (Exception ie) {
193	>	ie.printStackTrace();
194	>	return;
195		}
196		}
197		}
198
199		static class Consumer extends Stage {
200		Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
201	<	int iters, int lag) {
201	>	int iters, int lag) {
202		super(q, b, s, iters, lag);
203		}
204
#	Line 222 | Line 219 | public class MultipleProducersSingleCons
219		addConsumerSum(cs);
220		barrier.await();
221		}
222	<	catch (Exception ie) {
223	<	ie.printStackTrace();
224	<	return;
222	>	catch (Exception ie) {
223	>	ie.printStackTrace();
224	>	return;
225		}
226		}
227
228		}
229
233	–
230		static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception {
231
232		LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
#	Line 247 | Line 243 | public class MultipleProducersSingleCons
243		if (print)
244		System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * (n + 1))) + " ns per transfer");
245		}
246	<
246	>
247		static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
248		LTQasSQ() { super(); }
249		public void put(T x) {
250	<	try { super.transfer(x);
250	>	try { super.transfer(x);
251		} catch (InterruptedException ex) { throw new Error(); }
252		}
253		}
#	Line 263 | Line 259 | public class MultipleProducersSingleCons
259		if ((++calls & 1) == 0)
260		super.put(x);
261		else {
262	<	try { super.transfer(x);
263	<	} catch (InterruptedException ex) {
264	<	throw new Error();
262	>	try { super.transfer(x);
263	>	} catch (InterruptedException ex) {
264	>	throw new Error();
265		}
266		}
267		}
268		}
269		}
274	–

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines