test/loops/SingleProducerMultipleConsumerLoops.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.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.PriorityBlockingQueue;
import java.util.concurrent.SynchronousQueue;

public class SingleProducerMultipleConsumerLoops {
    static final int NCPUS = Runtime.getRuntime().availableProcessors();

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

    static final ExecutorService pool = Executors.newCachedThreadPool();
    static boolean print = false;

    // 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);
    }

    public static void main(String[] args) throws Exception {
        int maxn = 12;

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

        print = false;
        warmup();
        print = true;

        for (int k = 1, i = 1; i <= maxn;) {
            System.out.println("Consumers:" + 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;
        volatile int result;
        Stage(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
            queue = q;
            barrier = b;
            this.iters = iters;
        }
    }

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

        public void run() {
            try {
                barrier.await();
                int r = hashCode();
                for (int i = 0; i < iters; ++i) {
                    r = LoopHelpers.compute7(r);
                    Integer v = intPool[r & POOL_MASK];
                    queue.put(v);
                }
                barrier.await();
                result = 432;
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }
    }

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

        public void run() {
            try {
                barrier.await();
                int l = 0;
                int s = 0;
                for (int i = 0; i < iters; ++i) {
                    Integer item = queue.take();
                    s += item.intValue();
                }
                barrier.await();
                result = s;
                if (s == 0) System.out.print(" ");
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }

    }

    static void oneRun(BlockingQueue<Integer> q, int nconsumers, int iters) throws Exception {
        LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
        CyclicBarrier barrier = new CyclicBarrier(nconsumers + 2, timer);
        pool.execute(new Producer(q, barrier, iters * nconsumers));
        for (int i = 0; i < nconsumers; ++i) {
            pool.execute(new Consumer(q, barrier, iters));
        }
        barrier.await();
        barrier.await();
        long time = timer.getTime();
        if (print)
            System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * nconsumers)) + " 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(ex); }
        }
    }

    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(ex); }
            }
        }
    }

}
Revision:	1.12
Committed:	Sat Dec 31 21:34:47 2016 UTC (7 years, 3 months ago) by jsr166
Branch:	MAIN
CVS Tags:	HEAD
Changes since 1.11:	+4 -6 lines
Log Message:	better error handling
#	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.concurrent.ArrayBlockingQueue;
8	import java.util.concurrent.BlockingQueue;
9	import java.util.concurrent.CyclicBarrier;
10	import java.util.concurrent.ExecutorService;
11	import java.util.concurrent.Executors;
12	import java.util.concurrent.LinkedBlockingDeque;
13	import java.util.concurrent.LinkedBlockingQueue;
14	import java.util.concurrent.LinkedTransferQueue;
15	import java.util.concurrent.PriorityBlockingQueue;
16	import java.util.concurrent.SynchronousQueue;
17
18	public class SingleProducerMultipleConsumerLoops {
19	static final int NCPUS = Runtime.getRuntime().availableProcessors();
20
21	// Number of puts by producers or takes by consumers
22	static final int ITERS = 1 << 20;
23
24	static final ExecutorService pool = Executors.newCachedThreadPool();
25	static boolean print = false;
26
27	// Number of elements passed around -- must be power of two
28	// Elements are reused from pool to minimize alloc impact
29	static final int POOL_SIZE = 1 << 8;
30	static final int POOL_MASK = POOL_SIZE-1;
31	static final Integer[] intPool = new Integer[POOL_SIZE];
32	static {
33	for (int i = 0; i < POOL_SIZE; ++i)
34	intPool[i] = Integer.valueOf(i);
35	}
36
37	public static void main(String[] args) throws Exception {
38	int maxn = 12;
39
40	if (args.length > 0)
41	maxn = Integer.parseInt(args[0]);
42
43	print = false;
44	warmup();
45	print = true;
46
47	for (int k = 1, i = 1; i <= maxn;) {
48	System.out.println("Consumers:" + i);
49	oneTest(i, ITERS);
50	if (i == k) {
51	k = i << 1;
52	i = i + (i >>> 1);
53	}
54	else
55	i = k;
56	}
57
58	pool.shutdown();
59	}
60
61	static void warmup() throws Exception {
62	print = false;
63	System.out.print("Warmup ");
64	int it = 2000;
65	for (int j = 5; j > 0; --j) {
66	oneTest(j, it);
67	System.out.print(".");
68	it += 1000;
69	}
70	System.gc();
71	it = 20000;
72	for (int j = 5; j > 0; --j) {
73	oneTest(j, it);
74	System.out.print(".");
75	it += 10000;
76	}
77	System.gc();
78	System.out.println();
79	}
80
81	static void oneTest(int n, int iters) throws Exception {
82	int fairIters = iters/16;
83
84	Thread.sleep(100); // System.gc();
85	if (print)
86	System.out.print("LinkedTransferQueue ");
87	oneRun(new LinkedTransferQueue<Integer>(), n, iters);
88
89	Thread.sleep(100); // System.gc();
90	if (print)
91	System.out.print("LinkedBlockingQueue ");
92	oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
93
94	Thread.sleep(100); // System.gc();
95	if (print)
96	System.out.print("LinkedBlockingQueue(cap)");
97	oneRun(new LinkedBlockingQueue<Integer>(POOL_SIZE), n, iters);
98
99	Thread.sleep(100); // System.gc();
100	if (print)
101	System.out.print("LinkedBlockingDeque ");
102	oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
103
104	Thread.sleep(100); // System.gc();
105	if (print)
106	System.out.print("ArrayBlockingQueue ");
107	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
108
109	Thread.sleep(100); // System.gc();
110	if (print)
111	System.out.print("SynchronousQueue ");
112	oneRun(new SynchronousQueue<Integer>(), n, iters);
113
114	Thread.sleep(100); // System.gc();
115	if (print)
116	System.out.print("SynchronousQueue(fair) ");
117	oneRun(new SynchronousQueue<Integer>(true), n, iters);
118
119	Thread.sleep(100); // System.gc();
120	if (print)
121	System.out.print("LinkedTransferQueue(xfer)");
122	oneRun(new LTQasSQ<Integer>(), n, iters);
123
124	Thread.sleep(100); // System.gc();
125	if (print)
126	System.out.print("LinkedTransferQueue(half)");
127	oneRun(new HalfSyncLTQ<Integer>(), n, iters);
128
129	Thread.sleep(100); // System.gc();
130	if (print)
131	System.out.print("PriorityBlockingQueue ");
132	oneRun(new PriorityBlockingQueue<Integer>(), n, fairIters);
133
134	Thread.sleep(100); // System.gc();
135	if (print)
136	System.out.print("ArrayBlockingQueue(fair)");
137	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
138	}
139
140	abstract static class Stage implements Runnable {
141	final int iters;
142	final BlockingQueue<Integer> queue;
143	final CyclicBarrier barrier;
144	volatile int result;
145	Stage(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
146	queue = q;
147	barrier = b;
148	this.iters = iters;
149	}
150	}
151
152	static class Producer extends Stage {
153	Producer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
154	super(q, b, iters);
155	}
156
157	public void run() {
158	try {
159	barrier.await();
160	int r = hashCode();
161	for (int i = 0; i < iters; ++i) {
162	r = LoopHelpers.compute7(r);
163	Integer v = intPool[r & POOL_MASK];
164	queue.put(v);
165	}
166	barrier.await();
167	result = 432;
168	}
169	catch (Exception ie) {
170	ie.printStackTrace();
171	return;
172	}
173	}
174	}
175
176	static class Consumer extends Stage {
177	Consumer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
178	super(q, b, iters);
179	}
180
181	public void run() {
182	try {
183	barrier.await();
184	int l = 0;
185	int s = 0;
186	for (int i = 0; i < iters; ++i) {
187	Integer item = queue.take();
188	s += item.intValue();
189	}
190	barrier.await();
191	result = s;
192	if (s == 0) System.out.print(" ");
193	}
194	catch (Exception ie) {
195	ie.printStackTrace();
196	return;
197	}
198	}
199
200	}
201
202	static void oneRun(BlockingQueue<Integer> q, int nconsumers, int iters) throws Exception {
203	LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
204	CyclicBarrier barrier = new CyclicBarrier(nconsumers + 2, timer);
205	pool.execute(new Producer(q, barrier, iters * nconsumers));
206	for (int i = 0; i < nconsumers; ++i) {
207	pool.execute(new Consumer(q, barrier, iters));
208	}
209	barrier.await();
210	barrier.await();
211	long time = timer.getTime();
212	if (print)
213	System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * nconsumers)) + " ns per transfer");
214	}
215
216	static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
217	LTQasSQ() { super(); }
218	public void put(T x) {
219	try { super.transfer(x); }
220	catch (InterruptedException ex) { throw new Error(ex); }
221	}
222	}
223
224	static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> {
225	int calls;
226	HalfSyncLTQ() { super(); }
227	public void put(T x) {
228	if ((++calls & 1) == 0)
229	super.put(x);
230	else {
231	try { super.transfer(x); }
232	catch (InterruptedException ex) { throw new Error(ex); }
233	}
234	}
235	}
236
237	}