4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import java.util.*; |
8 |
< |
import java.util.concurrent.*; |
9 |
< |
//import jsr166y.*; |
7 |
> |
import java.util.Random; |
8 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
9 |
> |
import java.util.concurrent.BlockingQueue; |
10 |
> |
import java.util.concurrent.CyclicBarrier; |
11 |
> |
import java.util.concurrent.ExecutorService; |
12 |
> |
import java.util.concurrent.Executors; |
13 |
> |
import java.util.concurrent.LinkedBlockingDeque; |
14 |
> |
import java.util.concurrent.LinkedBlockingQueue; |
15 |
> |
import java.util.concurrent.LinkedTransferQueue; |
16 |
> |
import java.util.concurrent.Phaser; |
17 |
> |
import java.util.concurrent.PriorityBlockingQueue; |
18 |
> |
import java.util.concurrent.SynchronousQueue; |
19 |
|
|
20 |
|
public class ProducerConsumerLoops { |
21 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
13 |
– |
static final Random rng = new Random(); |
22 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
23 |
|
static boolean print = false; |
24 |
|
static int producerSum; |
62 |
|
|
63 |
|
warmup(); |
64 |
|
print = true; |
65 |
< |
int k = 1; |
58 |
< |
for (int i = 1; i <= maxPairs;) { |
65 |
> |
for (int k = 1, i = 1; i <= maxPairs;) { |
66 |
|
System.out.println("Pairs:" + i); |
67 |
|
oneTest(i, ITERS); |
68 |
|
if (i == k) { |
128 |
|
System.out.print("SynchronousQueue "); |
129 |
|
oneRun(new SynchronousQueue<Integer>(), n, iters); |
130 |
|
|
124 |
– |
|
131 |
|
Thread.sleep(100); // System.gc(); |
132 |
|
if (print) |
133 |
|
System.out.print("SynchronousQueue(fair) "); |
152 |
|
if (print) |
153 |
|
System.out.print("ArrayBlockingQueue(fair)"); |
154 |
|
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters); |
149 |
– |
|
155 |
|
} |
156 |
|
|
157 |
|
abstract static class Stage implements Runnable { |