forked from mjpt777/examples
/
QueuePerfTest.java
118 lines (104 loc) · 3.56 KB
/
QueuePerfTest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/*
* Copyright 2012 Real Logic Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package uk.co.real_logic.queues;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
import psy.lob.saw.queues.P1C1OffHeapQueue;
import psy.lob.saw.queues.P1C1Queue2CacheLinesHeapBuffer;
import psy.lob.saw.queues.P1C1Queue4CacheLinesHeapBuffer;
import psy.lob.saw.queues.P1C1Queue4CacheLinesHeapBufferUnsafe;
public class QueuePerfTest {
// 15 == 32* 1024
public static final int QUEUE_CAPACITY = 1 << Integer.getInteger("scale",
15);
public static final int REPETITIONS = Integer.getInteger("reps", 50) * 1000 * 1000;
public static final Integer TEST_VALUE = Integer.valueOf(777);
public static void main(final String[] args) throws Exception {
System.out.println("capacity:" + QUEUE_CAPACITY + " reps:"
+ REPETITIONS);
final Queue<Integer> queue = createQueue(args[0]);
for (int i = 0; i < 20; i++) {
System.gc();
performanceRun(i, queue);
}
}
private static Queue<Integer> createQueue(final String option) {
switch (Integer.parseInt(option)) {
case 0:
return new ArrayBlockingQueue<Integer>(QUEUE_CAPACITY);
case 1:
return new P1C1QueueOriginal1<Integer>(QUEUE_CAPACITY);
case 12:
return new P1C1QueueOriginal12<Integer>(QUEUE_CAPACITY);
case 2:
return new P1C1QueueOriginal2<Integer>(QUEUE_CAPACITY);
case 21:
return new P1C1QueueOriginal21<Integer>(QUEUE_CAPACITY);
case 22:
return new P1C1QueueOriginal22<Integer>(QUEUE_CAPACITY);
case 23:
return new P1C1QueueOriginal23<Integer>(QUEUE_CAPACITY);
case 3:
return new P1C1QueueOriginal3<Integer>(QUEUE_CAPACITY);
case 4:
return new P1C1Queue2CacheLinesHeapBuffer<Integer>(QUEUE_CAPACITY);
case 5:
return new P1C1Queue4CacheLinesHeapBuffer<Integer>(QUEUE_CAPACITY);
case 6:
return new P1C1Queue4CacheLinesHeapBufferUnsafe<Integer>(
QUEUE_CAPACITY);
case 7:
return new P1C1OffHeapQueue(QUEUE_CAPACITY);
case 8:
return new P1C1QueueOriginalPrimitive(QUEUE_CAPACITY);
default:
throw new IllegalArgumentException("Invalid option: " + option);
}
}
private static void performanceRun(final int runNumber,
final Queue<Integer> queue) throws Exception {
final long start = System.nanoTime();
final Thread thread = new Thread(new Producer(queue));
thread.start();
Integer result;
int i = REPETITIONS;
do {
while (null == (result = queue.poll())) {
Thread.yield();
}
} while (0 != --i);
thread.join();
final long duration = System.nanoTime() - start;
final long ops = (REPETITIONS * 1000L * 1000L * 1000L) / duration;
System.out.format("%d - ops/sec=%,d - %s result=%d\n", Integer
.valueOf(runNumber), Long.valueOf(ops), queue.getClass()
.getSimpleName(), result);
}
public static class Producer implements Runnable {
private final Queue<Integer> queue;
public Producer(final Queue<Integer> queue) {
this.queue = queue;
}
public void run() {
int i = REPETITIONS;
do {
while (!queue.offer(TEST_VALUE)) {
Thread.yield();
}
} while (0 != --i);
}
}
}