| 1 |
|
/* |
| 2 |
– |
* @test |
| 3 |
– |
* @synopsis multiple threads using a spinlock |
| 4 |
– |
*/ |
| 5 |
– |
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
< |
* Expert Group and released to the public domain. Use, modify, and |
| 4 |
< |
* redistribute this code in any way without acknowledgement. |
| 3 |
> |
* Expert Group and released to the public domain, as explained at |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
< |
import java.util.concurrent.*; |
| 8 |
< |
import java.util.concurrent.locks.*; |
| 9 |
< |
import java.util.concurrent.atomic.*; |
| 10 |
< |
import java.util.*; |
| 7 |
> |
import java.util.concurrent.CyclicBarrier; |
| 8 |
> |
import java.util.concurrent.ExecutorService; |
| 9 |
> |
import java.util.concurrent.Executors; |
| 10 |
> |
import java.util.concurrent.atomic.AtomicInteger; |
| 11 |
|
|
| 12 |
|
public final class SimpleSpinLockLoops { |
| 13 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
| 17 |
|
|
| 18 |
|
public static void main(String[] args) throws Exception { |
| 19 |
|
int maxThreads = 100; |
| 20 |
< |
if (args.length > 0) |
| 20 |
> |
if (args.length > 0) |
| 21 |
|
maxThreads = Integer.parseInt(args[0]); |
| 22 |
|
|
| 23 |
|
new LockLoop(1).test(); |
| 24 |
|
new LockLoop(1).test(); |
| 25 |
|
print = true; |
| 26 |
|
|
| 27 |
< |
int k = 1; |
| 32 |
< |
for (int i = 1; i <= maxThreads;) { |
| 27 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
| 28 |
|
System.out.print("Threads: " + i); |
| 29 |
|
new LockLoop(i).test(); |
| 30 |
|
Thread.sleep(100); |
| 31 |
|
if (i == k) { |
| 32 |
|
k = i << 1; |
| 33 |
|
i = i + (i >>> 1); |
| 34 |
< |
} |
| 35 |
< |
else |
| 34 |
> |
} |
| 35 |
> |
else |
| 36 |
|
i = k; |
| 37 |
|
} |
| 38 |
|
pool.shutdown(); |
| 52 |
|
} |
| 53 |
|
|
| 54 |
|
final void test() throws Exception { |
| 55 |
< |
for (int i = 0; i < nthreads; ++i) |
| 55 |
> |
for (int i = 0; i < nthreads; ++i) |
| 56 |
|
pool.execute(this); |
| 57 |
|
barrier.await(); |
| 58 |
|
barrier.await(); |
| 59 |
|
if (print) { |
| 60 |
|
long time = timer.getTime(); |
| 61 |
< |
long tpi = time / ((long)iters * nthreads); |
| 61 |
> |
long tpi = time / ((long) iters * nthreads); |
| 62 |
|
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
| 63 |
< |
double secs = (double)(time) / 1000000000.0; |
| 63 |
> |
double secs = (double) time / 1000000000.0; |
| 64 |
|
System.out.println("\t " + secs + "s run time"); |
| 65 |
|
} |
| 66 |
|
|
| 72 |
|
public final void run() { |
| 73 |
|
final AtomicInteger lock = this.spinlock; |
| 74 |
|
try { |
| 75 |
< |
barrier.await(); |
| 75 |
> |
barrier.await(); |
| 76 |
|
int sum = v + 1; |
| 77 |
|
int x = 0; |
| 78 |
|
int n = iters; |
| 79 |
|
while (n-- > 0) { |
| 80 |
< |
while (!lock.compareAndSet(0, 1)) ; |
| 80 |
> |
do {} while (!lock.compareAndSet(0, 1)); |
| 81 |
|
int k = (sum & 3); |
| 82 |
|
if (k > 0) { |
| 83 |
|
x = v; |
| 91 |
|
++readBarrier; |
| 92 |
|
for (int l = x & 1; l > 0; --l) |
| 93 |
|
sum += LoopHelpers.compute6(sum); |
| 94 |
< |
} |
| 94 |
> |
} |
| 95 |
|
barrier.await(); |
| 96 |
|
result += sum; |
| 97 |
|
} |
| 98 |
< |
catch (Exception ie) { |
| 99 |
< |
return; |
| 98 |
> |
catch (Exception ie) { |
| 99 |
> |
return; |
| 100 |
|
} |
| 101 |
|
} |
| 102 |
|
} |
| 103 |
|
|
| 104 |
|
} |
| 110 |
– |
|
