test/loops/PhaserLoops.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 jsr166y.*;

/**
 * Based loosely on Java Grande Forum barrierBench
 */
public class PhaserLoops {
    static final int NCPUS = Runtime.getRuntime().availableProcessors();
    static final ExecutorService pool = Executors.newCachedThreadPool();
    static final int FIRST_SIZE =   10000;
    static final int LAST_SIZE  = 1000000;
    /** for time conversion */
    static final long NPS = (1000L * 1000 * 1000);

    static final class PhaserAction implements Runnable {
        final int id;
        final int size;
        final Phaser phaser;
        public PhaserAction(int id, Phaser b, int size) {
            this.id = id;
            this.phaser = b;
            this.size = size;
            phaser.register();
        }


        public void run() {
            int n = size;
            Phaser b = phaser;
            for (int i = 0; i < n; ++i)
                b.arriveAndAwaitAdvance();
        }
    }

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

        System.out.printf("max %d Threads\n", nthreads);

        for (int k = 2; k <= nthreads; k *= 2) {
            for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
                long startTime = System.nanoTime();

                Phaser phaser = new Phaser();
                PhaserAction[] actions = new PhaserAction[nthreads];
                for (int i = 0; i < k; ++i) {
                    actions[i] = new PhaserAction(i, phaser, size);
                }

                Future[] futures = new Future[k];
                for (int i = 0; i < k; ++i) {
                    futures[i] = pool.submit(actions[i]);
                }
                for (int i = 0; i < k; ++i) {
                    futures[i].get();
                }
                long elapsed = System.nanoTime() - startTime;
                long bs = (NPS * size) / elapsed;
                System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n",
                                  k, size, bs);
            }
        }
        pool.shutdown();
    }

}
Revision:	1.5
Committed:	Sun Oct 21 06:40:21 2012 UTC (11 years, 6 months ago) by jsr166
Branch:	MAIN
Changes since 1.4:	+1 -2 lines
Log Message:	no blank line between javadoc and corresponding code
#	User	Rev	Content
1	dl	1.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	jsr166	1.4	* http://creativecommons.org/publicdomain/zero/1.0/
5	dl	1.1	*/
6
7			import java.util.*;
8			import java.util.concurrent.*;
9			//import jsr166y.*;
10
11	jsr166	1.5	/**
12	dl	1.1	* Based loosely on Java Grande Forum barrierBench
13			*/
14			public class PhaserLoops {
15			static final int NCPUS = Runtime.getRuntime().availableProcessors();
16			static final ExecutorService pool = Executors.newCachedThreadPool();
17			static final int FIRST_SIZE = 10000;
18			static final int LAST_SIZE = 1000000;
19			/** for time conversion */
20			static final long NPS = (1000L * 1000 * 1000);
21
22			static final class PhaserAction implements Runnable {
23			final int id;
24			final int size;
25			final Phaser phaser;
26			public PhaserAction(int id, Phaser b, int size) {
27			this.id = id;
28			this.phaser = b;
29			this.size = size;
30			phaser.register();
31			}
32
33
34			public void run() {
35			int n = size;
36			Phaser b = phaser;
37	jsr166	1.3	for (int i = 0; i < n; ++i)
38	dl	1.1	b.arriveAndAwaitAdvance();
39			}
40			}
41
42			public static void main(String[] args) throws Exception {
43			int nthreads = NCPUS;
44			if (args.length > 0)
45			nthreads = Integer.parseInt(args[0]);
46	jsr166	1.2
47	dl	1.1	System.out.printf("max %d Threads\n", nthreads);
48	jsr166	1.2
49	dl	1.1	for (int k = 2; k <= nthreads; k *= 2) {
50			for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
51			long startTime = System.nanoTime();
52	jsr166	1.2
53	dl	1.1	Phaser phaser = new Phaser();
54			PhaserAction[] actions = new PhaserAction[nthreads];
55			for (int i = 0; i < k; ++i) {
56			actions[i] = new PhaserAction(i, phaser, size);
57			}
58	jsr166	1.2
59	dl	1.1	Future[] futures = new Future[k];
60			for (int i = 0; i < k; ++i) {
61			futures[i] = pool.submit(actions[i]);
62			}
63			for (int i = 0; i < k; ++i) {
64			futures[i].get();
65			}
66			long elapsed = System.nanoTime() - startTime;
67			long bs = (NPS * size) / elapsed;
68			System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n",
69			k, size, bs);
70			}
71			}
72			pool.shutdown();
73			}
74	jsr166	1.2
75	dl	1.1	}