| 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/publicdomain/zero/1.0/ |
| 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 |
public class CyclicBarrierLoops { |
| 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 CyclicBarrierAction implements Runnable { |
| 23 |
final int id; |
| 24 |
final int size; |
| 25 |
final CyclicBarrier barrier; |
| 26 |
public CyclicBarrierAction(int id, CyclicBarrier b, int size) { |
| 27 |
this.id = id; |
| 28 |
this.barrier = b; |
| 29 |
this.size = size; |
| 30 |
} |
| 31 |
|
| 32 |
public void run() { |
| 33 |
try { |
| 34 |
int n = size; |
| 35 |
CyclicBarrier b = barrier; |
| 36 |
for (int i = 0; i < n; ++i) |
| 37 |
b.await(); |
| 38 |
} |
| 39 |
catch (Exception ex) { |
| 40 |
throw new Error(ex); |
| 41 |
} |
| 42 |
} |
| 43 |
} |
| 44 |
|
| 45 |
public static void main(String[] args) throws Exception { |
| 46 |
int nthreads = NCPUS; |
| 47 |
|
| 48 |
if (args.length > 0) |
| 49 |
nthreads = Integer.parseInt(args[0]); |
| 50 |
|
| 51 |
System.out.printf("max %d Threads\n", nthreads); |
| 52 |
|
| 53 |
for (int k = 2; k <= nthreads; k *= 2) { |
| 54 |
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
| 55 |
long startTime = System.nanoTime(); |
| 56 |
|
| 57 |
CyclicBarrier barrier = new CyclicBarrier(k); |
| 58 |
CyclicBarrierAction[] actions = new CyclicBarrierAction[k]; |
| 59 |
for (int i = 0; i < k; ++i) { |
| 60 |
actions[i] = new CyclicBarrierAction(i, barrier, size); |
| 61 |
} |
| 62 |
|
| 63 |
Future<?>[] futures = new Future<?>[k]; |
| 64 |
for (int i = 0; i < k; ++i) { |
| 65 |
futures[i] = pool.submit(actions[i]); |
| 66 |
} |
| 67 |
for (int i = 0; i < k; ++i) { |
| 68 |
futures[i].get(); |
| 69 |
} |
| 70 |
long elapsed = System.nanoTime() - startTime; |
| 71 |
long bs = (NPS * size) / elapsed; |
| 72 |
System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n", |
| 73 |
k, size, bs); |
| 74 |
} |
| 75 |
} |
| 76 |
pool.shutdown(); |
| 77 |
} |
| 78 |
|
| 79 |
} |
