test/loops/OfferPollLoops.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.Queue;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ConcurrentLinkedDeque;
import java.util.concurrent.ConcurrentLinkedQueue;
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;

public class OfferPollLoops {
    static final int NCPUS = Runtime.getRuntime().availableProcessors();
    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.
    // 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 maxN = 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("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("ConcurrentLinkedQueue   ");
        oneRun(new ConcurrentLinkedQueue<Integer>(), n, iters);

        Thread.sleep(100); // System.gc();
        if (print)
            System.out.print("ConcurrentLinkedDeque   ");
        oneRun(new ConcurrentLinkedDeque<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("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 Queue<Integer> queue;
        final CyclicBarrier barrier;
        final Phaser lagPhaser;
        Stage(Queue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
            queue = q;
            barrier = b;
            lagPhaser = s;
            this.iters = iters;
        }
    }

    static class Producer extends Stage {
        Producer(Queue<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();
                int i = 0;
                for (;;) {
                    r = LoopHelpers.compute7(r);
                    Integer v = intPool[r & POOL_MASK];
                    int k = v.intValue();
                    if (queue.offer(v)) {
                        ps += k;
                        ++i;
                        if (i >= iters)
                            break;
                        if ((i & LAG_MASK) == LAG_MASK)
                            lagPhaser.arriveAndAwaitAdvance();
                    }
                }
                addProducerSum(ps);
                barrier.await();
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }
    }

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

        public void run() {
            try {
                barrier.await();
                int cs = 0;
                int i = 0;
                for (;;) {
                    Integer v = queue.poll();
                    if (v != null) {
                        int k = v.intValue();
                        cs += k;
                        ++i;
                        if (i >= iters)
                            break;
                        if ((i & LAG_MASK) == LAG_MASK)
                            lagPhaser.arriveAndAwaitAdvance();
                    }
                }
                addConsumerSum(cs);
                barrier.await();
            }
            catch (Exception ie) {
                ie.printStackTrace();
                return;
            }
        }

    }

    static void oneRun(Queue<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");
    }

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