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.Random;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.LinkedBlockingDeque;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.LinkedTransferQueue;
import java.util.concurrent.Phaser;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.SynchronousQueue;

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;
        for (int k = 1, 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.11
Committed:	Sat Dec 31 19:37:25 2016 UTC (7 years, 4 months ago) by jsr166
Branch:	MAIN
Changes since 1.10:	+12 -3 lines
Log Message:	organize imports
#	User	Rev	Content
1	dl	1.1	/*
2			* Written by Doug Lea with assistance from members of JCP JSR-166
3	dl	1.2	* Expert Group and released to the public domain, as explained at
4	jsr166	1.7	* http://creativecommons.org/publicdomain/zero/1.0/
5	dl	1.1	*/
6
7	jsr166	1.11	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	dl	1.1
20			public class ProducerConsumerLoops {
21	dl	1.3	static final int NCPUS = Runtime.getRuntime().availableProcessors();
22			static final Random rng = new Random();
23	dl	1.1	static final ExecutorService pool = Executors.newCachedThreadPool();
24			static boolean print = false;
25			static int producerSum;
26			static int consumerSum;
27			static synchronized void addProducerSum(int x) {
28			producerSum += x;
29			}
30
31			static synchronized void addConsumerSum(int x) {
32			consumerSum += x;
33			}
34
35			static synchronized void checkSum() {
36			if (producerSum != consumerSum)
37			throw new Error("CheckSum mismatch");
38			}
39
40	dl	1.3	// 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	jsr166	1.4	for (int i = 0; i < POOL_SIZE; ++i)
47	dl	1.3	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	jsr166	1.4	// max lag between a producer and consumer to avoid
54	dl	1.3	// 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	dl	1.1	public static void main(String[] args) throws Exception {
59	dl	1.3	int maxPairs = NCPUS * 3 / 2;
60	dl	1.1
61	jsr166	1.4	if (args.length > 0)
62	dl	1.1	maxPairs = Integer.parseInt(args[0]);
63
64	dl	1.3	warmup();
65	dl	1.1	print = true;
66	jsr166	1.8	for (int k = 1, i = 1; i <= maxPairs;) {
67	dl	1.1	System.out.println("Pairs:" + i);
68	dl	1.3	oneTest(i, ITERS);
69	dl	1.1	if (i == k) {
70			k = i << 1;
71			i = i + (i >>> 1);
72	jsr166	1.4	}
73			else
74	dl	1.1	i = k;
75			}
76			pool.shutdown();
77	dl	1.3	}
78	dl	1.1
79	dl	1.3	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	jsr166	1.4	oneTest(j, it);
85	dl	1.3	System.out.print(".");
86			it += 1000;
87			}
88			System.gc();
89			it = 20000;
90			for (int j = 5; j > 0; --j) {
91	jsr166	1.4	oneTest(j, it);
92	dl	1.3	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	dl	1.1	if (print)
104	dl	1.3	System.out.print("LinkedTransferQueue ");
105			oneRun(new LinkedTransferQueue<Integer>(), n, iters);
106	dl	1.1
107	dl	1.3	Thread.sleep(100); // System.gc();
108	dl	1.1	if (print)
109			System.out.print("LinkedBlockingQueue ");
110	dl	1.3	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	dl	1.1
117	dl	1.3	Thread.sleep(100); // System.gc();
118	dl	1.1	if (print)
119			System.out.print("LinkedBlockingDeque ");
120	dl	1.3	oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
121	jsr166	1.4
122	dl	1.3	Thread.sleep(100); // System.gc();
123			if (print)
124			System.out.print("ArrayBlockingQueue ");
125			oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
126	dl	1.1
127	dl	1.3	Thread.sleep(100); // System.gc();
128	dl	1.1	if (print)
129			System.out.print("SynchronousQueue ");
130	dl	1.3	oneRun(new SynchronousQueue<Integer>(), n, iters);
131	dl	1.1
132	dl	1.3	Thread.sleep(100); // System.gc();
133	dl	1.1	if (print)
134			System.out.print("SynchronousQueue(fair) ");
135	dl	1.3	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	dl	1.1
142	dl	1.3	Thread.sleep(100); // System.gc();
143			if (print)
144			System.out.print("LinkedTransferQueue(half)");
145			oneRun(new HalfSyncLTQ<Integer>(), n, iters);
146	jsr166	1.4
147	dl	1.3	Thread.sleep(100); // System.gc();
148	dl	1.1	if (print)
149			System.out.print("PriorityBlockingQueue ");
150	dl	1.3	oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters);
151	dl	1.1
152	dl	1.3	Thread.sleep(100); // System.gc();
153	dl	1.1	if (print)
154			System.out.print("ArrayBlockingQueue(fair)");
155	dl	1.3	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
156	dl	1.1	}
157	jsr166	1.4
158	jsr166	1.6	abstract static class Stage implements Runnable {
159	dl	1.1	final int iters;
160			final BlockingQueue<Integer> queue;
161			final CyclicBarrier barrier;
162	dl	1.3	final Phaser lagPhaser;
163	jsr166	1.5	Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
164	jsr166	1.4	queue = q;
165	dl	1.1	barrier = b;
166	dl	1.3	lagPhaser = s;
167	dl	1.1	this.iters = iters;
168			}
169			}
170
171			static class Producer extends Stage {
172	dl	1.3	Producer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
173			int iters) {
174			super(q, b, s, iters);
175	dl	1.1	}
176
177			public void run() {
178			try {
179			barrier.await();
180	dl	1.3	int ps = 0;
181			int r = hashCode();
182	dl	1.1	for (int i = 0; i < iters; ++i) {
183	dl	1.3	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	dl	1.1	}
191	dl	1.3	addProducerSum(ps);
192	dl	1.1	barrier.await();
193			}
194	jsr166	1.4	catch (Exception ie) {
195			ie.printStackTrace();
196			return;
197	dl	1.1	}
198			}
199			}
200
201			static class Consumer extends Stage {
202	dl	1.3	Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
203	jsr166	1.4	int iters) {
204	dl	1.3	super(q, b, s, iters);
205	dl	1.1	}
206
207			public void run() {
208			try {
209			barrier.await();
210	dl	1.3	int cs = 0;
211	dl	1.1	for (int i = 0; i < iters; ++i) {
212	dl	1.3	Integer v = queue.take();
213			int k = v.intValue();
214			cs += k;
215			if ((i & LAG_MASK) == LAG_MASK)
216			lagPhaser.arriveAndAwaitAdvance();
217	dl	1.1	}
218	dl	1.3	addConsumerSum(cs);
219	dl	1.1	barrier.await();
220			}
221	jsr166	1.4	catch (Exception ie) {
222			ie.printStackTrace();
223			return;
224	dl	1.1	}
225			}
226
227			}
228
229	dl	1.3	static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception {
230	dl	1.1	LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
231	dl	1.3	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	dl	1.1	}
237			barrier.await();
238			barrier.await();
239			long time = timer.getTime();
240			checkSum();
241			if (print)
242	dl	1.3	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	jsr166	1.4	try { super.transfer(x);
249	dl	1.3	} catch (InterruptedException ex) { throw new Error(); }
250			}
251	dl	1.1	}
252
253	dl	1.3	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	jsr166	1.4	try { super.transfer(x);
261			} catch (InterruptedException ex) {
262			throw new Error();
263	dl	1.3	}
264			}
265			}
266			}
267	dl	1.1	}