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.*;
//import jsr166y.*;

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

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