![]() |
Roller CoasterLast updated: January 19, 2003 |
![]() |
Roller Coaster is a Java implementation of the famous Roller Coaster problem. It is intended to be a highly concurrent benchmarks, suitable for synchronization and concurrency measurements. This instance used a total of 7 passenger threads, and ran for 50 iterations of the main loop (i.e. 50 rides).
| From | To | Value |
|---|---|---|
| 8 | 8 | 0.003 |
| 16 | 16 | 0.102 |
| 24 | 24 | 0.346 |
| 32 | 32 | 0.060 |
| 40 | 40 | 0.111 |
| 48 | 72 | 0.267 |
| 80 | 136 | 0.075 |
| 144 | 392 | 0.028 |
| 400 | +Inf | 0.008 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.974 |
| 2 | 2 | 0.020 |
| 3 | +Inf | 0.006 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.987 |
| 2 | 2 | 0.011 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.978 |
| 2 | 2 | 0.011 |
| 3 | +Inf | 0.003 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.989 |
| 2 | 2 | 0.001 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |