test/loops/ConcurrentDequeLoops.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/licenses/publicdomain
 */

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

public class ConcurrentDequeLoops {
    static final ExecutorService pool = Executors.newCachedThreadPool();
    static AtomicInteger totalItems;
    static boolean print = false;

    public static void main(String[] args) throws Exception {
        int maxStages = 8;
        int items = 1000000;

        Class klass = null;
        if (args.length > 0) {
            try {
                klass = Class.forName(args[0]);
            } catch(ClassNotFoundException e) {
                throw new RuntimeException("Class " + args[0] + " not found.");
            }
        }
        else 
            throw new Error();

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

        System.out.print("Class: " + klass.getName());
        System.out.println(" stages: " + maxStages);

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

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

    static class Stage implements Callable<Integer> {
        final Deque<Integer> queue;
        final CyclicBarrier barrier;
        final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
        int items;
        Stage (Deque<Integer> q, CyclicBarrier b, int items) {
            queue = q; 
            barrier = b;
            this.items = items;
        }

        public Integer call() {
            // Repeatedly take something from queue if possible,
            // transform it, and put back in.
            try {
                barrier.await();
                int l = (int)System.nanoTime();
                int takes = 0;
                for (;;) {
                    Integer item;
                    int rnd = rng.next();
                    if ((rnd & 1) == 0)
                        item = queue.pollFirst();
                    else
                        item = queue.pollLast();
                    if (item != null) {
                        ++takes;
                        l += LoopHelpers.compute2(item.intValue());
                    }
                    else if (takes != 0) {
                        totalItems.getAndAdd(-takes);
                        takes = 0;
                    }
                    else if (totalItems.get() <= 0)
                        break;
                    l = LoopHelpers.compute1(l);
                    if (items > 0) {
                        --items;
                        Integer res = new Integer(l);
                        if ((rnd & 16) == 0)
                            queue.addFirst(res);
                        else
                            queue.addLast(res);
                    }
                    else { // spinwait 
                        for (int k = 1 + (l & 15); k != 0; --k)
                            l = LoopHelpers.compute1(LoopHelpers.compute2(l));
                        if ((l & 3) == 3) {
                            Thread.sleep(1);
                        }
                    }
                }
                return new Integer(l);
            }
            catch (Exception ie) { 
                ie.printStackTrace();
                throw new Error("Call loop failed");
            }
        }
    }

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

        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;
        if (print)
            System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item");
        if (total == 0) // avoid overoptimization
            System.out.println("useless result: " + total);
        
    }
}
Revision:	1.2
Committed:	Mon Feb 19 00:46:06 2007 UTC (17 years, 3 months ago) by dl
Branch:	MAIN
Changes since 1.1:	+2 -9 lines
Log Message:	Uniform headers
#	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			* http://creativecommons.org/licenses/publicdomain
5	dl	1.1	*/
6
7			import java.util.*;
8			import java.util.concurrent.*;
9			import java.util.concurrent.atomic.*;
10			import java.util.concurrent.locks.*;
11
12			public class ConcurrentDequeLoops {
13			static final ExecutorService pool = Executors.newCachedThreadPool();
14			static AtomicInteger totalItems;
15			static boolean print = false;
16
17			public static void main(String[] args) throws Exception {
18			int maxStages = 8;
19			int items = 1000000;
20
21			Class klass = null;
22			if (args.length > 0) {
23			try {
24			klass = Class.forName(args[0]);
25			} catch(ClassNotFoundException e) {
26			throw new RuntimeException("Class " + args[0] + " not found.");
27			}
28			}
29			else
30			throw new Error();
31
32			if (args.length > 1)
33			maxStages = Integer.parseInt(args[1]);
34
35			System.out.print("Class: " + klass.getName());
36			System.out.println(" stages: " + maxStages);
37
38			print = false;
39			System.out.println("Warmup...");
40			oneRun(klass, 1, items);
41			Thread.sleep(100);
42			oneRun(klass, 1, items);
43			Thread.sleep(100);
44			print = true;
45
46			int k = 1;
47			for (int i = 1; i <= maxStages;) {
48			oneRun(klass, i, items);
49			if (i == k) {
50			k = i << 1;
51			i = i + (i >>> 1);
52			}
53			else
54			i = k;
55			}
56			pool.shutdown();
57			}
58
59			static class Stage implements Callable<Integer> {
60			final Deque<Integer> queue;
61			final CyclicBarrier barrier;
62			final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
63			int items;
64			Stage (Deque<Integer> q, CyclicBarrier b, int items) {
65			queue = q;
66			barrier = b;
67			this.items = items;
68			}
69
70			public Integer call() {
71			// Repeatedly take something from queue if possible,
72			// transform it, and put back in.
73			try {
74			barrier.await();
75			int l = (int)System.nanoTime();
76			int takes = 0;
77			for (;;) {
78			Integer item;
79			int rnd = rng.next();
80			if ((rnd & 1) == 0)
81			item = queue.pollFirst();
82			else
83			item = queue.pollLast();
84			if (item != null) {
85			++takes;
86			l += LoopHelpers.compute2(item.intValue());
87			}
88			else if (takes != 0) {
89			totalItems.getAndAdd(-takes);
90			takes = 0;
91			}
92			else if (totalItems.get() <= 0)
93			break;
94			l = LoopHelpers.compute1(l);
95			if (items > 0) {
96			--items;
97			Integer res = new Integer(l);
98			if ((rnd & 16) == 0)
99			queue.addFirst(res);
100			else
101			queue.addLast(res);
102			}
103			else { // spinwait
104			for (int k = 1 + (l & 15); k != 0; --k)
105			l = LoopHelpers.compute1(LoopHelpers.compute2(l));
106			if ((l & 3) == 3) {
107			Thread.sleep(1);
108			}
109			}
110			}
111			return new Integer(l);
112			}
113			catch (Exception ie) {
114			ie.printStackTrace();
115			throw new Error("Call loop failed");
116			}
117			}
118			}
119
120			static void oneRun(Class klass, int n, int items) throws Exception {
121			Deque<Integer> q = (Deque<Integer>)klass.newInstance();
122			LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
123			CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
124			totalItems = new AtomicInteger(n * items);
125			ArrayList<Future<Integer>> results = new ArrayList<Future<Integer>>(n);
126			for (int i = 0; i < n; ++i)
127			results.add(pool.submit(new Stage(q, barrier, items)));
128
129			if (print)
130			System.out.print("Threads: " + n + "\t:");
131			barrier.await();
132			int total = 0;
133			for (int i = 0; i < n; ++i) {
134			Future<Integer> f = results.get(i);
135			Integer r = f.get();
136			total += r.intValue();
137			}
138			long endTime = System.nanoTime();
139			long time = endTime - timer.startTime;
140			if (print)
141			System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item");
142			if (total == 0) // avoid overoptimization
143			System.out.println("useless result: " + total);
144
145			}
146			}