| 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.concurrent.*; |
| 8 |
< |
import java.util.concurrent.locks.*; |
| 9 |
< |
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.locks.Lock; |
| 11 |
> |
import java.util.concurrent.locks.ReentrantLock; |
| 12 |
|
|
| 13 |
|
public final class SimpleFairReentrantLockLoops { |
| 14 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
| 25 |
|
new ReentrantLockLoop(1).test(); |
| 26 |
|
print = true; |
| 27 |
|
|
| 28 |
< |
int k = 1; |
| 27 |
< |
for (int i = 1; i <= maxThreads;) { |
| 28 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
| 29 |
|
System.out.print("Threads: " + i); |
| 30 |
|
new ReentrantLockLoop(i).test(); |
| 31 |
|
Thread.sleep(100); |
| 59 |
|
barrier.await(); |
| 60 |
|
if (print) { |
| 61 |
|
long time = timer.getTime(); |
| 62 |
< |
long tpi = time / ((long)iters * nthreads); |
| 62 |
> |
long tpi = time / ((long) iters * nthreads); |
| 63 |
|
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
| 64 |
< |
double secs = (double)(time) / 1000000000.0; |
| 64 |
> |
double secs = (double) time / 1000000000.0; |
| 65 |
|
System.out.println("\t " + secs + "s run time"); |
| 66 |
|
} |
| 67 |
|
|
