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.concurrent.ArrayBlockingQueue; |
8 |
> |
import java.util.concurrent.BlockingQueue; |
9 |
> |
import java.util.concurrent.CyclicBarrier; |
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 |
|
|
19 |
|
public class MultipleProducersSingleConsumerLoops { |
20 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
13 |
– |
static final Random rng = new Random(); |
21 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
22 |
|
static boolean print = false; |
23 |
|
static int producerSum; |
61 |
|
|
62 |
|
warmup(); |
63 |
|
print = true; |
64 |
< |
int k = 1; |
58 |
< |
for (int i = 1; i <= maxn;) { |
64 |
> |
for (int k = 1, i = 1; i <= maxn;) { |
65 |
|
System.out.println("Producers:" + i); |
66 |
|
oneTest(i, ITERS); |
67 |
|
if (i == k) { |
127 |
|
System.out.print("SynchronousQueue "); |
128 |
|
oneRun(new SynchronousQueue<Integer>(), n, iters); |
129 |
|
|
124 |
– |
|
130 |
|
Thread.sleep(100); // System.gc(); |
131 |
|
if (print) |
132 |
|
System.out.print("SynchronousQueue(fair) "); |
151 |
|
if (print) |
152 |
|
System.out.print("ArrayBlockingQueue(fair)"); |
153 |
|
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters); |
149 |
– |
|
150 |
– |
|
154 |
|
} |
155 |
|
|
156 |
|
abstract static class Stage implements Runnable { |
233 |
|
|
234 |
|
} |
235 |
|
|
233 |
– |
|
236 |
|
static void oneRun(BlockingQueue<Integer> q, int n, int iters) throws Exception { |
237 |
|
|
238 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
253 |
|
static final class LTQasSQ<T> extends LinkedTransferQueue<T> { |
254 |
|
LTQasSQ() { super(); } |
255 |
|
public void put(T x) { |
256 |
< |
try { super.transfer(x); |
257 |
< |
} catch (InterruptedException ex) { throw new Error(); } |
256 |
> |
try { super.transfer(x); } |
257 |
> |
catch (InterruptedException ex) { throw new Error(ex); } |
258 |
|
} |
259 |
|
} |
260 |
|
|
265 |
|
if ((++calls & 1) == 0) |
266 |
|
super.put(x); |
267 |
|
else { |
268 |
< |
try { super.transfer(x); |
269 |
< |
} catch (InterruptedException ex) { |
268 |
< |
throw new Error(); |
269 |
< |
} |
268 |
> |
try { super.transfer(x); } |
269 |
> |
catch (InterruptedException ex) { throw new Error(ex); } |
270 |
|
} |
271 |
|
} |
272 |
|
} |