| 51 |
|
nthreads = Integer.parseInt(args[0]); |
| 52 |
|
|
| 53 |
|
System.out.printf("max %d Threads\n", nthreads); |
| 54 |
< |
|
| 54 |
> |
|
| 55 |
|
for (int k = 2; k <= nthreads; k *= 2) { |
| 56 |
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
| 57 |
|
long startTime = System.nanoTime(); |
| 58 |
< |
|
| 58 |
> |
|
| 59 |
|
CyclicBarrier barrier = new CyclicBarrier(k); |
| 60 |
|
CyclicBarrierAction[] actions = new CyclicBarrierAction[k]; |
| 61 |
|
for (int i = 0; i < k; ++i) { |
| 62 |
|
actions[i] = new CyclicBarrierAction(i, barrier, size); |
| 63 |
|
} |
| 64 |
< |
|
| 64 |
> |
|
| 65 |
|
Future[] futures = new Future[k]; |
| 66 |
|
for (int i = 0; i < k; ++i) { |
| 67 |
|
futures[i] = pool.submit(actions[i]); |
| 77 |
|
} |
| 78 |
|
pool.shutdown(); |
| 79 |
|
} |
| 80 |
– |
|
| 81 |
– |
} |
| 82 |
– |
|
| 80 |
|
|
| 81 |
+ |
} |
