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.*; |
8 |
|
import java.util.concurrent.*; |
9 |
|
import java.util.concurrent.locks.*; |
9 |
– |
import java.util.*; |
10 |
|
|
11 |
|
public final class SimpleNoLockLoops { |
12 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
16 |
|
|
17 |
|
public static void main(String[] args) throws Exception { |
18 |
|
int maxThreads = 100; |
19 |
< |
if (args.length > 0) |
19 |
> |
if (args.length > 0) |
20 |
|
maxThreads = Integer.parseInt(args[0]); |
21 |
|
|
22 |
|
new ReentrantLockLoop(1).test(); |
23 |
|
new ReentrantLockLoop(1).test(); |
24 |
|
print = true; |
25 |
|
|
26 |
< |
int k = 1; |
27 |
< |
for (int i = 1; i <= maxThreads;) { |
26 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
27 |
|
System.out.print("Threads: " + i); |
28 |
|
new ReentrantLockLoop(i).test(); |
29 |
|
Thread.sleep(100); |
30 |
|
if (i == k) { |
31 |
|
k = i << 1; |
32 |
|
i = i + (i >>> 1); |
33 |
< |
} |
34 |
< |
else |
33 |
> |
} |
34 |
> |
else |
35 |
|
i = k; |
36 |
|
} |
37 |
|
pool.shutdown(); |
50 |
|
} |
51 |
|
|
52 |
|
final void test() throws Exception { |
53 |
< |
for (int i = 0; i < nthreads; ++i) |
53 |
> |
for (int i = 0; i < nthreads; ++i) |
54 |
|
pool.execute(this); |
55 |
|
barrier.await(); |
56 |
|
barrier.await(); |
57 |
|
if (print) { |
58 |
|
long time = timer.getTime(); |
59 |
< |
long tpi = time / ((long)iters * nthreads); |
59 |
> |
long tpi = time / ((long) iters * nthreads); |
60 |
|
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
61 |
< |
double secs = (double)(time) / 1000000000.0; |
61 |
> |
double secs = (double) time / 1000000000.0; |
62 |
|
System.out.println("\t " + secs + "s run time"); |
63 |
|
} |
64 |
|
|
69 |
|
|
70 |
|
public final void run() { |
71 |
|
try { |
72 |
< |
barrier.await(); |
72 |
> |
barrier.await(); |
73 |
|
int sum = v + 1; |
74 |
|
int x = 0; |
75 |
|
int n = iters; |
88 |
|
++readBarrier; |
89 |
|
for (int l = x & 1; l > 0; --l) |
90 |
|
sum += LoopHelpers.compute6(sum); |
91 |
< |
} |
91 |
> |
} |
92 |
|
barrier.await(); |
93 |
|
result += sum; |
94 |
|
} |
95 |
< |
catch (Exception ie) { |
96 |
< |
return; |
95 |
> |
catch (Exception ie) { |
96 |
> |
return; |
97 |
|
} |
98 |
|
} |
99 |
|
} |
100 |
|
|
101 |
|
} |
103 |
– |
|