Repository navigation
Expand file tree
/
Copy pathQueuePerfTest.java
More file actions
100 lines (85 loc) · 2.84 KB
/
Copy pathQueuePerfTest.java
File metadata and controls
100 lines (85 loc) · 2.84 KB
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
/**
*
* 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 javaopt.queue;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
public class QueuePerfTest {
public static final int QUEUE_CAPACITY = 1 << 15;
public static final int ITERATION = 50000000;
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 = ITERATION;
do {
Integer msg = new Integer(i);
while (!queue.offer(msg)) {
Thread.yield();
}
} while (0 != --i);
}
}
public static void main(final String[] args) throws Exception {
System.out.println("capacity:" + QUEUE_CAPACITY + " iteration:" + ITERATION);
int op = Integer.parseInt(args[0]);
final Queue<Integer> queue = createQueue(op);
for (int i = 0; i < 20; i++) {
System.gc();
performanceRun(i,queue, op);
}
}
private static Queue<Integer> createQueue(final int option) {
switch (option) {
case 0:
return new ArrayBlockingQueue<Integer>(QUEUE_CAPACITY);
case 1:
return new P1C1QueueStep1<Integer>(QUEUE_CAPACITY);
case 2:
return new P1C1QueueStep2<Integer>(QUEUE_CAPACITY);
case 3:
return new P1C1QueueStep3<Integer>(QUEUE_CAPACITY);
case 4:
return new P1C1QueueStep4<Integer>(QUEUE_CAPACITY);
case 5:
return new P1C1QueueStep5(QUEUE_CAPACITY);
case 6:
return new P1C1QueueStep6(QUEUE_CAPACITY);
default:
throw new IllegalArgumentException("Invalid option: " + option);
}
}
private static void performanceRun(final int runNumber,
final Queue<Integer> queue, int op) throws Exception {
final long start = System.nanoTime();
final Thread thread = new Thread(new Producer(queue));
thread.start();
Integer e;
long result = 0;
int i = ITERATION;
do {
while (null == (e = queue.poll())) {
Thread.yield();
}
result += e.intValue();
} while (0 != --i);
thread.join();
final long duration = System.nanoTime() - start;
final long ops = (ITERATION * 1000L * 1000L * 1000L) / duration;
System.out.format("optimize step %d : %d - ops/sec=%,d result=%d\n", op,
Integer.valueOf(runNumber), Long.valueOf(ops), result);
}
}