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

/*
 * Based loosely on Java Grande Forum barrierBench
 */

public class TieredPhaserLoops {
    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 int tasksPerPhaser = Math.max(NCPUS / 8, 4);

    static void build(Runnable[] actions, int sz, int lo, int hi, Phaser b) {
        int step = (hi - lo) / tasksPerPhaser;
        if (step > 1) {
            int i = lo;
            while (i < hi) {
                int r = Math.min(i + step, hi);
                build(actions, sz, i, r, new Phaser(b));
                i = r;
            }
        }
        else {
            for (int i = lo; i < hi; ++i)
                actions[i] = new PhaserAction(i, b, sz);
        }
    }

    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]);
        if (args.length > 1)
            tasksPerPhaser = Integer.parseInt(args[1]);

        System.out.printf("Max %d Threads, %d tasks per phaser\n", nthreads, tasksPerPhaser);

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

                Runnable[] actions = new Runnable [k];
                build(actions, size, 0, k, new Phaser());
                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.2
Committed:	Mon Nov 2 20:23:53 2009 UTC (14 years, 6 months ago) by jsr166
Branch:	MAIN
Changes since 1.1:	+5 -7 lines
Log Message:	whitespace
#	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			* http://creativecommons.org/licenses/publicdomain
5			*/
6
7			import java.util.*;
8			import java.util.concurrent.*;
9			//import jsr166y.*;
10
11			/*
12			* Based loosely on Java Grande Forum barrierBench
13			*/
14
15			public class TieredPhaserLoops {
16			static final int NCPUS = Runtime.getRuntime().availableProcessors();
17			static final ExecutorService pool = Executors.newCachedThreadPool();
18			static final int FIRST_SIZE = 10000;
19			static final int LAST_SIZE = 1000000;
20			/** for time conversion */
21			static final long NPS = (1000L * 1000 * 1000);
22
23			static int tasksPerPhaser = Math.max(NCPUS / 8, 4);
24	jsr166	1.2
25	dl	1.1	static void build(Runnable[] actions, int sz, int lo, int hi, Phaser b) {
26			int step = (hi - lo) / tasksPerPhaser;
27			if (step > 1) {
28			int i = lo;
29			while (i < hi) {
30			int r = Math.min(i + step, hi);
31			build(actions, sz, i, r, new Phaser(b));
32			i = r;
33			}
34			}
35			else {
36	jsr166	1.2	for (int i = lo; i < hi; ++i)
37	dl	1.1	actions[i] = new PhaserAction(i, b, sz);
38			}
39			}
40
41			static final class PhaserAction implements Runnable {
42			final int id;
43			final int size;
44			final Phaser phaser;
45			public PhaserAction(int id, Phaser b, int size) {
46			this.id = id;
47			this.phaser = b;
48			this.size = size;
49			phaser.register();
50			}
51
52
53			public void run() {
54			int n = size;
55			Phaser b = phaser;
56			for(int i = 0; i < n; ++i)
57			b.arriveAndAwaitAdvance();
58			}
59			}
60
61			public static void main(String[] args) throws Exception {
62			int nthreads = NCPUS;
63			if (args.length > 0)
64			nthreads = Integer.parseInt(args[0]);
65			if (args.length > 1)
66			tasksPerPhaser = Integer.parseInt(args[1]);
67	jsr166	1.2
68	dl	1.1	System.out.printf("Max %d Threads, %d tasks per phaser\n", nthreads, tasksPerPhaser);
69
70			for (int k = 2; k <= nthreads; k *= 2) {
71			for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
72			long startTime = System.nanoTime();
73	jsr166	1.2
74	dl	1.1	Runnable[] actions = new Runnable [k];
75			build(actions, size, 0, k, new Phaser());
76			Future[] futures = new Future[k];
77			for (int i = 0; i < k; ++i) {
78			futures[i] = pool.submit(actions[i]);
79			}
80			for (int i = 0; i < k; ++i) {
81			futures[i].get();
82			}
83			long elapsed = System.nanoTime() - startTime;
84			long bs = (NPS * size) / elapsed;
85			System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n",
86			k, size, bs);
87			}
88			}
89			pool.shutdown();
90			}
91	jsr166	1.2
92	dl	1.1	}