test/loops/NoopNoLockLoops.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.*;
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
import java.util.concurrent.locks.*;

public final class NoopNoLockLoops {
    static final ExecutorService pool = Executors.newCachedThreadPool();
    static final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
    static boolean print = false;
    static int iters = 20000000;

    public static void main(String[] args) throws Exception {
        int maxThreads = 100;
        if (args.length > 0)
            maxThreads = Integer.parseInt(args[0]);

        new ReentrantLockLoop(1).test();
        new ReentrantLockLoop(1).test();
        print = true;

        for (int k = 1, i = 1; i <= maxThreads;) {
            System.out.print("Threads: " + i);
            new ReentrantLockLoop(i).test();
            Thread.sleep(100);
            if (i == k) {
                k = i << 1;
                i = i + (i >>> 1);
            }
            else
                i = k;
        }
        pool.shutdown();
    }

    static final class ReentrantLockLoop implements Runnable {
        private int v = rng.next();
        private volatile int result = 17;
        private final LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
        private final CyclicBarrier barrier;
        private final int nthreads;
        private volatile int readBarrier;
        ReentrantLockLoop(int nthreads) {
            this.nthreads = nthreads;
            barrier = new CyclicBarrier(nthreads+1, timer);
        }

        final void test() throws Exception {
            for (int i = 0; i < nthreads; ++i)
                pool.execute(this);
            barrier.await();
            barrier.await();
            if (print) {
                long time = timer.getTime();
                long tpi = time / ((long) iters * nthreads);
                System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock");
                double secs = (double) time / 1000000000.0;
                System.out.println("\t " + secs + "s run time");
            }

            int r = result;
            if (r == 0) // avoid overoptimization
                System.out.println("useless result: " + r);
        }

        public final void run() {
            try {
                barrier.await();
                int sum = v + 1;
                int x = sum + 1;
                int n = iters;
                while (n-- > 0) {
                    x = LoopHelpers.compute4(x);
                    sum += x;
                    if ((x += readBarrier) == 0)
                        ++readBarrier;

                }
                barrier.await();
                result += sum;
            }
            catch (Exception ie) {
                return;
            }
        }
    }

}
Revision:	1.7
Committed:	Wed Dec 31 17:00:58 2014 UTC (9 years, 4 months ago) by jsr166
Branch:	MAIN
Changes since 1.6:	+2 -2 lines
Log Message:	lexicographic import order
#	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.5	* http://creativecommons.org/publicdomain/zero/1.0/
5	dl	1.1	*/
6
7	jsr166	1.7	import java.util.*;
8	dl	1.1	import java.util.concurrent.*;
9	jsr166	1.7	import java.util.concurrent.atomic.*;
10	dl	1.1	import java.util.concurrent.locks.*;
11
12			public final class NoopNoLockLoops {
13			static final ExecutorService pool = Executors.newCachedThreadPool();
14			static final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
15			static boolean print = false;
16			static int iters = 20000000;
17
18			public static void main(String[] args) throws Exception {
19			int maxThreads = 100;
20	jsr166	1.3	if (args.length > 0)
21	dl	1.1	maxThreads = Integer.parseInt(args[0]);
22
23			new ReentrantLockLoop(1).test();
24			new ReentrantLockLoop(1).test();
25			print = true;
26
27	jsr166	1.6	for (int k = 1, i = 1; i <= maxThreads;) {
28	dl	1.1	System.out.print("Threads: " + i);
29			new ReentrantLockLoop(i).test();
30			Thread.sleep(100);
31			if (i == k) {
32			k = i << 1;
33			i = i + (i >>> 1);
34	jsr166	1.3	}
35			else
36	dl	1.1	i = k;
37			}
38			pool.shutdown();
39			}
40
41			static final class ReentrantLockLoop implements Runnable {
42			private int v = rng.next();
43			private volatile int result = 17;
44			private final LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
45			private final CyclicBarrier barrier;
46			private final int nthreads;
47			private volatile int readBarrier;
48			ReentrantLockLoop(int nthreads) {
49			this.nthreads = nthreads;
50			barrier = new CyclicBarrier(nthreads+1, timer);
51			}
52
53			final void test() throws Exception {
54	jsr166	1.3	for (int i = 0; i < nthreads; ++i)
55	dl	1.1	pool.execute(this);
56			barrier.await();
57			barrier.await();
58			if (print) {
59			long time = timer.getTime();
60	jsr166	1.4	long tpi = time / ((long) iters * nthreads);
61	dl	1.1	System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock");
62	jsr166	1.4	double secs = (double) time / 1000000000.0;
63	dl	1.1	System.out.println("\t " + secs + "s run time");
64			}
65
66			int r = result;
67			if (r == 0) // avoid overoptimization
68			System.out.println("useless result: " + r);
69			}
70
71			public final void run() {
72			try {
73	jsr166	1.3	barrier.await();
74	dl	1.1	int sum = v + 1;
75			int x = sum + 1;
76			int n = iters;
77			while (n-- > 0) {
78			x = LoopHelpers.compute4(x);
79			sum += x;
80			if ((x += readBarrier) == 0)
81			++readBarrier;
82
83			}
84			barrier.await();
85			result += sum;
86			}
87	jsr166	1.3	catch (Exception ie) {
88			return;
89	dl	1.1	}
90			}
91			}
92
93			}