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 |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import java.util.concurrent.*; |
8 |
< |
|
7 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
8 |
> |
import java.util.concurrent.CyclicBarrier; |
9 |
> |
import java.util.concurrent.BlockingQueue; |
10 |
> |
import java.util.concurrent.ExecutorService; |
11 |
> |
import java.util.concurrent.Executors; |
12 |
> |
import java.util.concurrent.LinkedBlockingDeque; |
13 |
> |
import java.util.concurrent.LinkedBlockingQueue; |
14 |
> |
import java.util.concurrent.LinkedTransferQueue; |
15 |
> |
import java.util.concurrent.Phaser; |
16 |
> |
import java.util.concurrent.PriorityBlockingQueue; |
17 |
> |
import java.util.concurrent.SynchronousQueue; |
18 |
> |
import java.util.concurrent.TimeUnit; |
19 |
|
|
20 |
|
public class TimeoutProducerConsumerLoops { |
21 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
61 |
|
maxPairs = Integer.parseInt(args[0]); |
62 |
|
|
63 |
|
print = true; |
64 |
< |
int k = 1; |
55 |
< |
for (int i = 1; i <= maxPairs;) { |
64 |
> |
for (int k = 1, i = 1; i <= maxPairs;) { |
65 |
|
System.out.println("Pairs:" + i); |
66 |
|
oneTest(i, iters); |
67 |
|
Thread.sleep(100); |
73 |
|
i = k; |
74 |
|
} |
75 |
|
pool.shutdown(); |
76 |
< |
} |
76 |
> |
} |
77 |
|
|
78 |
|
static void oneTest(int n, int iters) throws Exception { |
79 |
|
if (print) |
115 |
|
if (print) |
116 |
|
System.out.print("ArrayBlockingQueue(fair) "); |
117 |
|
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, iters/16); |
109 |
– |
|
118 |
|
} |
119 |
|
|
120 |
|
abstract static class Stage implements Runnable { |