test/loops/MultipleProducersSingleConsumerLoops.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 MultipleProducersSingleConsumerLoops {
    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 << 8;
    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.
    static final int LAG = (1 << 12);
    static final int LAG_MASK = LAG - 1;

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

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

        warmup();
        print = true;
        for (int k = 1, i = 1; i <= maxn;) {
            System.out.println("Producers:" + 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;
        final int lag;
        Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
              int iters, int lag) {
            queue = q;
            barrier = b;
            lagPhaser = s;
            this.iters = iters;
            this.lag = lag;
        }
    }

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

        public void run() {
            try {
                barrier.await();
                int ps = 0;
                int r = hashCode();
                int j = 0;
                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 (++j == lag) {
                        j = 0;
                        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, int lag) {
            super(q, b, s, iters, lag);
        }

        public void run() {
            try {
                barrier.await();
                int cs = 0;
                int j = 0;
                for (int i = 0; i < iters; ++i) {
                    Integer v = queue.take();
                    int k = v.intValue();
                    cs += k;
                    if (++j == lag) {
                        j = 0;
                        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, timer);
        Phaser s = new Phaser(n + 1);
        for (int i = 0; i < n; ++i) {
            pool.execute(new Producer(q, barrier, s, iters, LAG));
        }
        pool.execute(new Consumer(q, barrier, s, iters * n, LAG * n));
        barrier.await();
        barrier.await();
        long time = timer.getTime();
        checkSum();
        if (print)
            System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * (n + 1))) + " 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:	Mon Aug 10 03:13:33 2015 UTC (8 years, 8 months ago) by jsr166
Branch:	MAIN
Changes since 1.10:	+0 -1 lines
Log Message:	delete unwanted blank lines
#	User	Rev	Content
1	dl	1.1	/*
2			* Written by Doug Lea with assistance from members of JCP JSR-166
3	dl	1.3	* Expert Group and released to the public domain, as explained at
4	jsr166	1.8	* http://creativecommons.org/publicdomain/zero/1.0/
5	dl	1.1	*/
6
7	dl	1.4	import java.util.*;
8	dl	1.1	import java.util.concurrent.*;
9	dl	1.4	//import jsr166y.*;
10	dl	1.1
11			public class MultipleProducersSingleConsumerLoops {
12	dl	1.4	static final int NCPUS = Runtime.getRuntime().availableProcessors();
13			static final Random rng = new Random();
14	dl	1.1	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	dl	1.4	// 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 << 8;
34			static final int POOL_MASK = POOL_SIZE-1;
35			static final Integer[] intPool = new Integer[POOL_SIZE];
36			static {
37	jsr166	1.5	for (int i = 0; i < POOL_SIZE; ++i)
38	dl	1.4	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	jsr166	1.5	// max lag between a producer and consumer to avoid
45	dl	1.4	// this becoming a GC test rather than queue test.
46			static final int LAG = (1 << 12);
47			static final int LAG_MASK = LAG - 1;
48
49	dl	1.1	public static void main(String[] args) throws Exception {
50	dl	1.4	int maxn = 12; // NCPUS * 3 / 2;
51	dl	1.1
52	jsr166	1.5	if (args.length > 0)
53	dl	1.4	maxn = Integer.parseInt(args[0]);
54	dl	1.1
55	dl	1.4	warmup();
56	dl	1.1	print = true;
57	jsr166	1.9	for (int k = 1, i = 1; i <= maxn;) {
58	dl	1.1	System.out.println("Producers:" + i);
59	dl	1.4	oneTest(i, ITERS);
60			if (i == k) {
61			k = i << 1;
62			i = i + (i >>> 1);
63	jsr166	1.5	}
64			else
65	dl	1.4	i = k;
66	dl	1.1	}
67			pool.shutdown();
68	dl	1.4	}
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	jsr166	1.5	oneTest(j, it);
76	dl	1.4	System.out.print(".");
77			it += 1000;
78			}
79			System.gc();
80			it = 20000;
81			for (int j = 5; j > 0; --j) {
82	jsr166	1.5	oneTest(j, it);
83	dl	1.4	System.out.print(".");
84			it += 10000;
85			}
86			System.gc();
87			System.out.println();
88			}
89	dl	1.1
90	dl	1.4	static void oneTest(int n, int iters) throws Exception {
91			int fairIters = iters/16;
92
93			Thread.sleep(100); // System.gc();
94	dl	1.1	if (print)
95	dl	1.4	System.out.print("LinkedTransferQueue ");
96			oneRun(new LinkedTransferQueue<Integer>(), n, iters);
97	dl	1.1
98	dl	1.4	Thread.sleep(100); // System.gc();
99	dl	1.1	if (print)
100			System.out.print("LinkedBlockingQueue ");
101	dl	1.4	oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
102	dl	1.1
103	dl	1.4	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	jsr166	1.5
113	dl	1.4	Thread.sleep(100); // System.gc();
114			if (print)
115			System.out.print("ArrayBlockingQueue ");
116			oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
117	dl	1.1
118	dl	1.4	Thread.sleep(100); // System.gc();
119	dl	1.1	if (print)
120			System.out.print("SynchronousQueue ");
121	dl	1.4	oneRun(new SynchronousQueue<Integer>(), n, iters);
122	dl	1.1
123	dl	1.4	Thread.sleep(100); // System.gc();
124	dl	1.1	if (print)
125	dl	1.2	System.out.print("SynchronousQueue(fair) ");
126	dl	1.4	oneRun(new SynchronousQueue<Integer>(true), n, iters);
127
128			Thread.sleep(100); // System.gc();
129			if (print)
130			System.out.print("LinkedTransferQueue(xfer)");
131			oneRun(new LTQasSQ<Integer>(), n, iters);
132
133			Thread.sleep(100); // System.gc();
134			if (print)
135			System.out.print("LinkedTransferQueue(half)");
136			oneRun(new HalfSyncLTQ<Integer>(), n, iters);
137	jsr166	1.5
138	dl	1.4	Thread.sleep(100); // System.gc();
139			if (print)
140			System.out.print("PriorityBlockingQueue ");
141			oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters);
142	dl	1.2
143	dl	1.4	Thread.sleep(100); // System.gc();
144	dl	1.2	if (print)
145	dl	1.1	System.out.print("ArrayBlockingQueue(fair)");
146	dl	1.4	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
147	dl	1.1	}
148	jsr166	1.5
149	jsr166	1.7	abstract static class Stage implements Runnable {
150	dl	1.1	final int iters;
151			final BlockingQueue<Integer> queue;
152			final CyclicBarrier barrier;
153	dl	1.4	final Phaser lagPhaser;
154			final int lag;
155	jsr166	1.6	Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
156			int iters, int lag) {
157	jsr166	1.5	queue = q;
158	dl	1.1	barrier = b;
159	dl	1.4	lagPhaser = s;
160	dl	1.1	this.iters = iters;
161	dl	1.4	this.lag = lag;
162	dl	1.1	}
163			}
164
165			static class Producer extends Stage {
166	dl	1.4	Producer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
167			int iters, int lag) {
168			super(q, b, s, iters, lag);
169	dl	1.1	}
170
171			public void run() {
172			try {
173			barrier.await();
174	dl	1.4	int ps = 0;
175			int r = hashCode();
176			int j = 0;
177	dl	1.1	for (int i = 0; i < iters; ++i) {
178	dl	1.4	r = LoopHelpers.compute7(r);
179			Integer v = intPool[r & POOL_MASK];
180			int k = v.intValue();
181			queue.put(v);
182			ps += k;
183			if (++j == lag) {
184			j = 0;
185			lagPhaser.arriveAndAwaitAdvance();
186			}
187	dl	1.1	}
188	dl	1.4	addProducerSum(ps);
189	dl	1.1	barrier.await();
190			}
191	jsr166	1.5	catch (Exception ie) {
192			ie.printStackTrace();
193			return;
194	dl	1.1	}
195			}
196			}
197
198			static class Consumer extends Stage {
199	dl	1.4	Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
200	jsr166	1.5	int iters, int lag) {
201	dl	1.4	super(q, b, s, iters, lag);
202	dl	1.1	}
203
204			public void run() {
205			try {
206			barrier.await();
207	dl	1.4	int cs = 0;
208			int j = 0;
209	dl	1.1	for (int i = 0; i < iters; ++i) {
210	dl	1.4	Integer v = queue.take();
211			int k = v.intValue();
212			cs += k;
213			if (++j == lag) {
214			j = 0;
215			lagPhaser.arriveAndAwaitAdvance();
216			}
217	dl	1.1	}
218	dl	1.4	addConsumerSum(cs);
219	dl	1.1	barrier.await();
220			}
221	jsr166	1.5	catch (Exception ie) {
222			ie.printStackTrace();
223			return;
224	dl	1.1	}
225			}
226
227			}
228
229	dl	1.4	static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception {
230
231	dl	1.1	LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
232	dl	1.4	CyclicBarrier barrier = new CyclicBarrier(n + 2, timer);
233			Phaser s = new Phaser(n + 1);
234			for (int i = 0; i < n; ++i) {
235			pool.execute(new Producer(q, barrier, s, iters, LAG));
236	dl	1.1	}
237	dl	1.4	pool.execute(new Consumer(q, barrier, s, iters * n, LAG * n));
238	dl	1.1	barrier.await();
239			barrier.await();
240			long time = timer.getTime();
241			checkSum();
242			if (print)
243	dl	1.4	System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * (n + 1))) + " ns per transfer");
244			}
245	jsr166	1.5
246	dl	1.4	static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
247			LTQasSQ() { super(); }
248			public void put(T x) {
249	jsr166	1.5	try { super.transfer(x);
250	dl	1.4	} catch (InterruptedException ex) { throw new Error(); }
251			}
252	dl	1.1	}
253
254	dl	1.4	static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> {
255			int calls;
256			HalfSyncLTQ() { super(); }
257			public void put(T x) {
258			if ((++calls & 1) == 0)
259			super.put(x);
260			else {
261	jsr166	1.5	try { super.transfer(x);
262			} catch (InterruptedException ex) {
263			throw new Error();
264	dl	1.4	}
265			}
266			}
267			}
268	dl	1.1	}