test/loops/ConcurrentQueueLoops.java

/*
 * @test %I% %E%
 * @bug 4486658
 * @compile -source 1.5 ConcurrentQueueLoops.java
 * @run main/timeout=230 ConcurrentQueueLoops
 * @summary Checks that a set of threads can repeatedly get and modify items
 */
/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain. Use, modify, and
 * redistribute this code in any way without acknowledgement.
 */

import java.util.*;
import java.util.concurrent.*;
import java.util.concurrent.locks.*;
import java.util.concurrent.atomic.*;

public class ConcurrentQueueLoops {
    static final ExecutorService pool = Executors.newCachedThreadPool();
    static boolean print = false;
    static final Integer zero = new Integer(0);
    static final Integer one = new Integer(1);
    static int workMask;
    static final long RUN_TIME_NANOS = 5 * 1000L * 1000L * 1000L;
    static final int BATCH_SIZE = 8;

    public static void main(String[] args) throws Exception {
        int maxStages = 100;
        int work = 1024;
        Class klass = null;
        if (args.length > 0) {
            try {
                klass = Class.forName(args[0]);
            } catch(ClassNotFoundException e) {
                throw new RuntimeException("Class " + args[0] + " not found.");
            }
        }

        if (args.length > 1) 
            maxStages = Integer.parseInt(args[1]);

        if (args.length > 2) 
            work = Integer.parseInt(args[2]);

        workMask = work - 1;
        System.out.print("Class: " + klass.getName());
        System.out.print(" stages: " + maxStages);
        System.out.println(" work: " + work);

        print = false;
        System.out.println("Warmup...");
        oneRun(klass, 4);
        Thread.sleep(100);
        oneRun(klass, 1);
        Thread.sleep(100);
        print = true;

        int k = 1;
        for (int i = 1; i <= maxStages;) {
            oneRun(klass, i);
            if (i == k) {
                k = i << 1;
                i = i + (i >>> 1);
            } 
            else 
                i = k;
        }
        pool.shutdown();
   }

    static final class Stage implements Callable<Integer> {
        final Queue<Integer> queue;
        final CyclicBarrier barrier;
        final int nthreads;
        Stage (Queue<Integer> q, CyclicBarrier b, int nthreads) {
            queue = q; 
            barrier = b;
            this.nthreads = nthreads;
        }

        static int compute(int l) {
            if (l == 0) 
                return (int)System.nanoTime();
            int nn =  (l >>> 7) & workMask;
            while (nn-- > 0) 
                l = LoopHelpers.compute6(l);
            return l;
        }

        public Integer call() {
            try {
                barrier.await();
                long now = System.nanoTime();
                long stopTime = now + RUN_TIME_NANOS;
                int l = (int)now;
                int takes = 0;
                int misses = 0;
                int lmask = 1;
                for (;;) {
                    l = compute(l);
                    Integer item = queue.poll();
                    if (item != null) {
                        ++takes;
                        if (item == one)
                            l = LoopHelpers.compute6(l);
                    } else if ((misses++ & 255) == 0 &&
                               System.nanoTime() >= stopTime) {
                        return new Integer(takes);
                    } else {
                        for (int i = 0; i < BATCH_SIZE; ++i) {
                            queue.offer(((l & lmask)== 0)? zero : one);
                            if ((lmask <<= 1) == 0) lmask = 1;
                            if (i != 0) l = compute(l);
                        }
                    }
                }
            }
            catch (Exception ie) { 
                ie.printStackTrace();
                throw new Error("Call loop failed");
            }
        }
    }

    static void oneRun(Class klass, int n) throws Exception {
        Queue<Integer> q = (Queue<Integer>)klass.newInstance();
        LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
        CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
        ArrayList<Future<Integer>> results = new ArrayList<Future<Integer>>(n);
        for (int i = 0; i < n; ++i) 
            results.add(pool.submit(new Stage(q, barrier, n)));

        if (print)
            System.out.print("Threads: " + n + "\t:");
        barrier.await();
        int total = 0;
        for (int i = 0; i < n; ++i) {
            Future<Integer> f = results.get(i);
            Integer r = f.get();
            total += r.intValue();
        }
        long endTime = System.nanoTime();
        long time = endTime - timer.startTime;
        long ips = 1000000000L * total / time;
        
        if (print) 
            System.out.print(LoopHelpers.rightJustify(ips) + " items per sec");
        if (print)
            System.out.println();
    }

}
Revision:	1.3
Committed:	Fri Oct 7 14:58:09 2005 UTC (18 years, 7 months ago) by dl
Branch:	MAIN
Changes since 1.2:	+25 -26 lines
Log Message:	Improve to report throughput
#	User	Rev	Content
1	dl	1.1	/*
2			* @test %I% %E%
3			* @bug 4486658
4			* @compile -source 1.5 ConcurrentQueueLoops.java
5			* @run main/timeout=230 ConcurrentQueueLoops
6			* @summary Checks that a set of threads can repeatedly get and modify items
7			*/
8			/*
9			* Written by Doug Lea with assistance from members of JCP JSR-166
10			* Expert Group and released to the public domain. Use, modify, and
11			* redistribute this code in any way without acknowledgement.
12			*/
13
14			import java.util.*;
15			import java.util.concurrent.*;
16	dl	1.2	import java.util.concurrent.locks.*;
17	dl	1.1	import java.util.concurrent.atomic.*;
18
19			public class ConcurrentQueueLoops {
20			static final ExecutorService pool = Executors.newCachedThreadPool();
21			static boolean print = false;
22	dl	1.3	static final Integer zero = new Integer(0);
23			static final Integer one = new Integer(1);
24	dl	1.2	static int workMask;
25			static final long RUN_TIME_NANOS = 5 * 1000L * 1000L * 1000L;
26	dl	1.3	static final int BATCH_SIZE = 8;
27	dl	1.1
28			public static void main(String[] args) throws Exception {
29	dl	1.3	int maxStages = 100;
30			int work = 1024;
31	dl	1.1	Class klass = null;
32			if (args.length > 0) {
33			try {
34			klass = Class.forName(args[0]);
35			} catch(ClassNotFoundException e) {
36			throw new RuntimeException("Class " + args[0] + " not found.");
37			}
38			}
39
40			if (args.length > 1)
41			maxStages = Integer.parseInt(args[1]);
42
43	dl	1.2	if (args.length > 2)
44			work = Integer.parseInt(args[2]);
45
46			workMask = work - 1;
47	dl	1.1	System.out.print("Class: " + klass.getName());
48	dl	1.2	System.out.print(" stages: " + maxStages);
49			System.out.println(" work: " + work);
50	dl	1.1
51			print = false;
52			System.out.println("Warmup...");
53	dl	1.2	oneRun(klass, 4);
54	dl	1.1	Thread.sleep(100);
55	dl	1.2	oneRun(klass, 1);
56	dl	1.1	Thread.sleep(100);
57			print = true;
58
59	dl	1.2	int k = 1;
60			for (int i = 1; i <= maxStages;) {
61			oneRun(klass, i);
62			if (i == k) {
63			k = i << 1;
64			i = i + (i >>> 1);
65			}
66			else
67			i = k;
68	dl	1.1	}
69			pool.shutdown();
70			}
71
72	dl	1.2	static final class Stage implements Callable<Integer> {
73	dl	1.1	final Queue<Integer> queue;
74			final CyclicBarrier barrier;
75	dl	1.3	final int nthreads;
76			Stage (Queue<Integer> q, CyclicBarrier b, int nthreads) {
77	dl	1.1	queue = q;
78			barrier = b;
79	dl	1.3	this.nthreads = nthreads;
80	dl	1.2	}
81
82			static int compute(int l) {
83			if (l == 0)
84			return (int)System.nanoTime();
85	dl	1.3	int nn = (l >>> 7) & workMask;
86	dl	1.2	while (nn-- > 0)
87	dl	1.3	l = LoopHelpers.compute6(l);
88	dl	1.2	return l;
89	dl	1.1	}
90
91			public Integer call() {
92			try {
93			barrier.await();
94	dl	1.2	long now = System.nanoTime();
95			long stopTime = now + RUN_TIME_NANOS;
96			int l = (int)now;
97	dl	1.1	int takes = 0;
98	dl	1.2	int misses = 0;
99	dl	1.3	int lmask = 1;
100	dl	1.1	for (;;) {
101	dl	1.2	l = compute(l);
102	dl	1.1	Integer item = queue.poll();
103			if (item != null) {
104			++takes;
105	dl	1.3	if (item == one)
106			l = LoopHelpers.compute6(l);
107	dl	1.2	} else if ((misses++ & 255) == 0 &&
108			System.nanoTime() >= stopTime) {
109	dl	1.3	return new Integer(takes);
110	dl	1.2	} else {
111	dl	1.3	for (int i = 0; i < BATCH_SIZE; ++i) {
112			queue.offer(((l & lmask)== 0)? zero : one);
113			if ((lmask <<= 1) == 0) lmask = 1;
114			if (i != 0) l = compute(l);
115			}
116	dl	1.1	}
117			}
118			}
119			catch (Exception ie) {
120			ie.printStackTrace();
121			throw new Error("Call loop failed");
122			}
123			}
124			}
125
126	dl	1.2	static void oneRun(Class klass, int n) throws Exception {
127	dl	1.1	Queue<Integer> q = (Queue<Integer>)klass.newInstance();
128			LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
129			CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
130			ArrayList<Future<Integer>> results = new ArrayList<Future<Integer>>(n);
131			for (int i = 0; i < n; ++i)
132	dl	1.3	results.add(pool.submit(new Stage(q, barrier, n)));
133	dl	1.1
134			if (print)
135			System.out.print("Threads: " + n + "\t:");
136			barrier.await();
137			int total = 0;
138			for (int i = 0; i < n; ++i) {
139			Future<Integer> f = results.get(i);
140			Integer r = f.get();
141			total += r.intValue();
142			}
143			long endTime = System.nanoTime();
144			long time = endTime - timer.startTime;
145	dl	1.3	long ips = 1000000000L * total / time;
146
147			if (print)
148			System.out.print(LoopHelpers.rightJustify(ips) + " items per sec");
149	dl	1.1	if (print)
150	dl	1.3	System.out.println();
151	dl	1.1	}
152	dl	1.2
153	dl	1.1	}