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.10
Committed:	Mon Aug 10 03:13:33 2015 UTC (8 years, 9 months ago) by jsr166
Branch:	MAIN
Changes since 1.9:	+0 -2 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.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			import java.util.concurrent.*;
8	dl	1.3	//import jsr166y.*;
9	dl	1.1
10			public class SingleProducerMultipleConsumerLoops {
11	dl	1.3	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	dl	1.1
16			static final ExecutorService pool = Executors.newCachedThreadPool();
17			static boolean print = false;
18
19	dl	1.3	// 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	jsr166	1.4	for (int i = 0; i < POOL_SIZE; ++i)
26	dl	1.3	intPool[i] = Integer.valueOf(i);
27			}
28
29	dl	1.1	public static void main(String[] args) throws Exception {
30	dl	1.3	int maxn = 12;
31	dl	1.1
32	jsr166	1.4	if (args.length > 0)
33	dl	1.3	maxn = Integer.parseInt(args[0]);
34	dl	1.1
35			print = false;
36	dl	1.3	warmup();
37	dl	1.1	print = true;
38	dl	1.3
39	jsr166	1.9	for (int k = 1, i = 1; i <= maxn;) {
40	dl	1.1	System.out.println("Consumers:" + i);
41	dl	1.3	oneTest(i, ITERS);
42			if (i == k) {
43			k = i << 1;
44			i = i + (i >>> 1);
45	jsr166	1.4	}
46			else
47	dl	1.3	i = k;
48	dl	1.1	}
49	jsr166	1.4
50	dl	1.1	pool.shutdown();
51	jsr166	1.8	}
52	dl	1.1
53	dl	1.3	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	jsr166	1.4	oneTest(j, it);
59	dl	1.3	System.out.print(".");
60			it += 1000;
61			}
62			System.gc();
63			it = 20000;
64			for (int j = 5; j > 0; --j) {
65	jsr166	1.4	oneTest(j, it);
66	dl	1.3	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	dl	1.1	if (print)
78	dl	1.3	System.out.print("LinkedTransferQueue ");
79			oneRun(new LinkedTransferQueue<Integer>(), n, iters);
80	dl	1.1
81	dl	1.3	Thread.sleep(100); // System.gc();
82	dl	1.1	if (print)
83			System.out.print("LinkedBlockingQueue ");
84	dl	1.3	oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
85	dl	1.1
86	dl	1.3	Thread.sleep(100); // System.gc();
87	dl	1.1	if (print)
88	dl	1.3	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	jsr166	1.4
96	dl	1.3	Thread.sleep(100); // System.gc();
97			if (print)
98			System.out.print("ArrayBlockingQueue ");
99			oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
100	dl	1.1
101	dl	1.3	Thread.sleep(100); // System.gc();
102	dl	1.1	if (print)
103			System.out.print("SynchronousQueue ");
104	dl	1.3	oneRun(new SynchronousQueue<Integer>(), n, iters);
105	jsr166	1.4
106	dl	1.3	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	dl	1.1
116	dl	1.3	Thread.sleep(100); // System.gc();
117			if (print)
118			System.out.print("LinkedTransferQueue(half)");
119			oneRun(new HalfSyncLTQ<Integer>(), n, iters);
120	jsr166	1.4
121	dl	1.3	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	dl	1.1	if (print)
128			System.out.print("ArrayBlockingQueue(fair)");
129	dl	1.3	oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
130	dl	1.1	}
131	jsr166	1.4
132	jsr166	1.6	abstract static class Stage implements Runnable {
133	dl	1.1	final int iters;
134			final BlockingQueue<Integer> queue;
135			final CyclicBarrier barrier;
136			volatile int result;
137	jsr166	1.5	Stage(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
138	jsr166	1.4	queue = q;
139	dl	1.1	barrier = b;
140			this.iters = iters;
141			}
142			}
143
144			static class Producer extends Stage {
145			Producer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
146			super(q, b, iters);
147			}
148
149			public void run() {
150			try {
151			barrier.await();
152	dl	1.3	int r = hashCode();
153	dl	1.1	for (int i = 0; i < iters; ++i) {
154	dl	1.3	r = LoopHelpers.compute7(r);
155			Integer v = intPool[r & POOL_MASK];
156			queue.put(v);
157	dl	1.1	}
158			barrier.await();
159			result = 432;
160			}
161	jsr166	1.4	catch (Exception ie) {
162			ie.printStackTrace();
163			return;
164	dl	1.1	}
165			}
166			}
167
168			static class Consumer extends Stage {
169	jsr166	1.4	Consumer(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
170	dl	1.1	super(q, b, iters);
171			}
172
173			public void run() {
174			try {
175			barrier.await();
176			int l = 0;
177			int s = 0;
178			for (int i = 0; i < iters; ++i) {
179			Integer item = queue.take();
180	dl	1.3	s += item.intValue();
181	dl	1.1	}
182			barrier.await();
183			result = s;
184	dl	1.3	if (s == 0) System.out.print(" ");
185	dl	1.1	}
186	jsr166	1.4	catch (Exception ie) {
187			ie.printStackTrace();
188			return;
189	dl	1.1	}
190			}
191
192			}
193
194			static void oneRun(BlockingQueue<Integer> q, int nconsumers, int iters) throws Exception {
195			LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
196			CyclicBarrier barrier = new CyclicBarrier(nconsumers + 2, timer);
197			pool.execute(new Producer(q, barrier, iters * nconsumers));
198			for (int i = 0; i < nconsumers; ++i) {
199			pool.execute(new Consumer(q, barrier, iters));
200			}
201			barrier.await();
202			barrier.await();
203			long time = timer.getTime();
204			if (print)
205			System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * nconsumers)) + " ns per transfer");
206			}
207
208	dl	1.3	static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
209			LTQasSQ() { super(); }
210			public void put(T x) {
211	jsr166	1.4	try { super.transfer(x);
212	dl	1.3	} catch (InterruptedException ex) { throw new Error(); }
213			}
214			}
215
216			static final class HalfSyncLTQ<T> extends LinkedTransferQueue<T> {
217			int calls;
218			HalfSyncLTQ() { super(); }
219			public void put(T x) {
220			if ((++calls & 1) == 0)
221			super.put(x);
222			else {
223	jsr166	1.4	try { super.transfer(x);
224			} catch (InterruptedException ex) {
225			throw new Error();
226	dl	1.3	}
227			}
228			}
229			}
230
231	dl	1.1	}