test/loops/ProducerConsumerLoops.java

/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/publicdomain/zero/1.0/
 */

import java.util.*;
import java.util.concurrent.*;
//import jsr166y.*;

public class ProducerConsumerLoops {
    static final int NCPUS = Runtime.getRuntime().availableProcessors();
    static final Random rng = new Random();
    static final ExecutorService pool = Executors.newCachedThreadPool();
    static boolean print = false;
    static int producerSum;
    static int consumerSum;
    static synchronized void addProducerSum(int x) {
        producerSum += x;
    }

    static synchronized void addConsumerSum(int x) {
        consumerSum += x;
    }

    static synchronized void checkSum() {
        if (producerSum != consumerSum)
            throw new Error("CheckSum mismatch");
    }

    // Number of elements passed around -- must be power of two
    // Elements are reused from pool to minimize alloc impact
    static final int POOL_SIZE = 1 << 7;
    static final int POOL_MASK = POOL_SIZE-1;
    static final Integer[] intPool = new Integer[POOL_SIZE];
    static {
        for (int i = 0; i < POOL_SIZE; ++i)
            intPool[i] = Integer.valueOf(i);
    }

    // Number of puts by producers or takes by consumers
    static final int ITERS = 1 << 20;

    // max lag between a producer and consumer to avoid
    // this becoming a GC test rather than queue test.
    // Used only per-pair to lessen impact on queue sync
    static final int LAG_MASK = (1 << 12) - 1;

    public static void main(String[] args) throws Exception {
        int maxPairs = NCPUS * 3 / 2;

        if (args.length > 0)
            maxPairs = Integer.parseInt(args[0]);

        warmup();
        print = true;
        int k = 1;
        for (int i = 1; i <= maxPairs;) {
            System.out.println("Pairs:" + i);
            oneTest(i, ITERS);
            if (i == k) {
                k = i << 1;
                i = i + (i >>> 1);
            }
            else
                i = k;
        }
        pool.shutdown();
    }

    static void warmup() throws Exception {
        print = false;
        System.out.print("Warmup ");
        int it = 2000;
        for (int j = 5; j > 0; --j) {
            oneTest(j, it);
            System.out.print(".");
            it += 1000;
        }
        System.gc();
        it = 20000;
        for (int j = 5; j > 0; --j) {
            oneTest(j, it);
            System.out.print(".");
            it += 10000;
        }
        System.gc();
        System.out.println();
    }

    static void oneTest(int n, int iters) throws Exception {
        int fairIters = iters/16;

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedTransferQueue     ");
        oneRun(new LinkedTransferQueue<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedBlockingQueue     ");
        oneRun(new LinkedBlockingQueue<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedBlockingQueue(cap)");
        oneRun(new LinkedBlockingQueue<Integer>(POOL_SIZE), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedBlockingDeque     ");
        oneRun(new LinkedBlockingDeque<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("ArrayBlockingQueue      ");
        oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("SynchronousQueue        ");
        oneRun(new SynchronousQueue<Integer>(), n, iters);


        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("SynchronousQueue(fair)  ");
        oneRun(new SynchronousQueue<Integer>(true), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedTransferQueue(xfer)");
        oneRun(new LTQasSQ<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("LinkedTransferQueue(half)");
        oneRun(new HalfSyncLTQ<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("PriorityBlockingQueue   ");
        oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("ArrayBlockingQueue(fair)");
        oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);

    }

    abstract static class Stage implements Runnable {
        final int iters;
        final BlockingQueue<Integer> queue;
        final CyclicBarrier barrier;
        final Phaser lagPhaser;
        Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
            queue = q;
            barrier = b;
            lagPhaser = s;
            this.iters = iters;
        }
    }

    static class Producer extends Stage {
        Producer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
                 int iters) {
            super(q, b, s, iters);
        }

        public void run() {
            try {
                barrier.await();
                int ps = 0;
                int r = hashCode();
                for (int i = 0; i < iters; ++i) {
                    r = LoopHelpers.compute7(r);
                    Integer v = intPool[r & POOL_MASK];
                    int k = v.intValue();
                    queue.put(v);
                    ps += k;
                    if ((i & LAG_MASK) == LAG_MASK)
                        lagPhaser.arriveAndAwaitAdvance();
                }
                addProducerSum(ps);
                barrier.await();
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }
    }

    static class Consumer extends Stage {
        Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
                 int iters) {
            super(q, b, s, iters);
        }

        public void run() {
            try {
                barrier.await();
                int cs = 0;
                for (int i = 0; i < iters; ++i) {
                    Integer v = queue.take();
                    int k = v.intValue();
                    cs += k;
                    if ((i & LAG_MASK) == LAG_MASK)
                        lagPhaser.arriveAndAwaitAdvance();
                }
                addConsumerSum(cs);
                barrier.await();
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }

    }

    static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception {
        LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
        CyclicBarrier barrier = new CyclicBarrier(n * 2 + 1, timer);
        for (int i = 0; i < n; ++i) {
            Phaser s = new Phaser(2);
            pool.execute(new Producer(q, barrier, s, iters));
            pool.execute(new Consumer(q, barrier, s, iters));
        }
        barrier.await();
        barrier.await();
        long time = timer.getTime();
        checkSum();
        if (print)
            System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer");
    }

    static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
        LTQasSQ() { super(); }
        public void put(T x) {
            try { super.transfer(x);
            } catch (InterruptedException ex) { throw new Error(); }
        }
    }

    static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> {
        int calls;
        HalfSyncLTQ() { super(); }
        public void put(T x) {
            if ((++calls & 1) == 0)
                super.put(x);
            else {
                try { super.transfer(x);
                } catch (InterruptedException ex) {
                    throw new Error();
                }
            }
        }
    }
}
Revision:	1.7
Committed:	Tue Mar 15 19:47:05 2011 UTC (13 years, 2 months ago) by jsr166
Branch:	MAIN
CVS Tags:	release-1_7_0
Changes since 1.6:	+1 -1 lines
Log Message:	Update Creative Commons license URL in legal notices
#	Content
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	int k = 1;
58	for (int i = 1; i <= maxPairs;) {
59	System.out.println("Pairs:" + i);
60	oneTest(i, ITERS);
61	if (i == k) {
62	k = i << 1;
63	i = i + (i >>> 1);
64	}
65	else
66	i = k;
67	}
68	pool.shutdown();
69	}
70
71	static void warmup() throws Exception {
72	print = false;
73	System.out.print("Warmup ");
74	int it = 2000;
75	for (int j = 5; j > 0; --j) {
76	oneTest(j, it);
77	System.out.print(".");
78	it += 1000;
79	}
80	System.gc();
81	it = 20000;
82	for (int j = 5; j > 0; --j) {
83	oneTest(j, it);
84	System.out.print(".");
85	it += 10000;
86	}
87	System.gc();
88	System.out.println();
89	}
90
91	static void oneTest(int n, int iters) throws Exception {
92	int fairIters = iters/16;
93
94	Thread.sleep(100); // System.gc();
95	if (print)
96	System.out.print("LinkedTransferQueue ");
97	oneRun(new LinkedTransferQueue<Integer>(), n, iters);
98
99	Thread.sleep(100); // System.gc();
100	if (print)
101	System.out.print("LinkedBlockingQueue ");
102	oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
103
104	Thread.sleep(100); // System.gc();
105	if (print)
106	System.out.print("LinkedBlockingQueue(cap)");
107	oneRun(new LinkedBlockingQueue<Integer>(POOL_SIZE), n, iters);
108
109	Thread.sleep(100); // System.gc();
110	if (print)
111	System.out.print("LinkedBlockingDeque ");
112	oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
113
114	Thread.sleep(100); // System.gc();
115	if (print)
116	System.out.print("ArrayBlockingQueue ");
117	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
118
119	Thread.sleep(100); // System.gc();
120	if (print)
121	System.out.print("SynchronousQueue ");
122	oneRun(new SynchronousQueue<Integer>(), n, iters);
123
124
125	Thread.sleep(100); // System.gc();
126	if (print)
127	System.out.print("SynchronousQueue(fair) ");
128	oneRun(new SynchronousQueue<Integer>(true), n, iters);
129
130	Thread.sleep(100); // System.gc();
131	if (print)
132	System.out.print("LinkedTransferQueue(xfer)");
133	oneRun(new LTQasSQ<Integer>(), n, iters);
134
135	Thread.sleep(100); // System.gc();
136	if (print)
137	System.out.print("LinkedTransferQueue(half)");
138	oneRun(new HalfSyncLTQ<Integer>(), n, iters);
139
140	Thread.sleep(100); // System.gc();
141	if (print)
142	System.out.print("PriorityBlockingQueue ");
143	oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters);
144
145	Thread.sleep(100); // System.gc();
146	if (print)
147	System.out.print("ArrayBlockingQueue(fair)");
148	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
149
150	}
151
152	abstract static class Stage implements Runnable {
153	final int iters;
154	final BlockingQueue<Integer> queue;
155	final CyclicBarrier barrier;
156	final Phaser lagPhaser;
157	Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
158	queue = q;
159	barrier = b;
160	lagPhaser = s;
161	this.iters = iters;
162	}
163	}
164
165	static class Producer extends Stage {
166	Producer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
167	int iters) {
168	super(q, b, s, iters);
169	}
170
171	public void run() {
172	try {
173	barrier.await();
174	int ps = 0;
175	int r = hashCode();
176	for (int i = 0; i < iters; ++i) {
177	r = LoopHelpers.compute7(r);
178	Integer v = intPool[r & POOL_MASK];
179	int k = v.intValue();
180	queue.put(v);
181	ps += k;
182	if ((i & LAG_MASK) == LAG_MASK)
183	lagPhaser.arriveAndAwaitAdvance();
184	}
185	addProducerSum(ps);
186	barrier.await();
187	}
188	catch (Exception ie) {
189	ie.printStackTrace();
190	return;
191	}
192	}
193	}
194
195	static class Consumer extends Stage {
196	Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
197	int iters) {
198	super(q, b, s, iters);
199	}
200
201	public void run() {
202	try {
203	barrier.await();
204	int cs = 0;
205	for (int i = 0; i < iters; ++i) {
206	Integer v = queue.take();
207	int k = v.intValue();
208	cs += k;
209	if ((i & LAG_MASK) == LAG_MASK)
210	lagPhaser.arriveAndAwaitAdvance();
211	}
212	addConsumerSum(cs);
213	barrier.await();
214	}
215	catch (Exception ie) {
216	ie.printStackTrace();
217	return;
218	}
219	}
220
221	}
222
223	static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception {
224	LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
225	CyclicBarrier barrier = new CyclicBarrier(n * 2 + 1, timer);
226	for (int i = 0; i < n; ++i) {
227	Phaser s = new Phaser(2);
228	pool.execute(new Producer(q, barrier, s, iters));
229	pool.execute(new Consumer(q, barrier, s, iters));
230	}
231	barrier.await();
232	barrier.await();
233	long time = timer.getTime();
234	checkSum();
235	if (print)
236	System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer");
237	}
238
239	static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
240	LTQasSQ() { super(); }
241	public void put(T x) {
242	try { super.transfer(x);
243	} catch (InterruptedException ex) { throw new Error(); }
244	}
245	}
246
247	static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> {
248	int calls;
249	HalfSyncLTQ() { super(); }
250	public void put(T x) {
251	if ((++calls & 1) == 0)
252	super.put(x);
253	else {
254	try { super.transfer(x);
255	} catch (InterruptedException ex) {
256	throw new Error();
257	}
258	}
259	}
260	}
261	}