CPU scaling benchmark
workers
2 +1 main
iters total
500M
166666666/stream
elapsed
1474.31 ms
total CPU used
4343.37 ms
speedup
2.95×
vs serial
efficiency
98.3%
of 3× ideal
| stream | spawn ms | spawned@ | work start@ | work end@ | work ms | reap wait ms |
|---|---|---|---|---|---|---|
| 0 (main) | 0 | 3.56 | 3.57 | 1443.04 | 1439.47 | 0 |
| 1 | 1.951 | 1.97 | 16.29 | 1464.93 | 1448.64 | 22.05 |
| 2 | 1.55 | 3.54 | 16.43 | 1471.69 | 1455.26 | 28.78 |
main
w1
w2
fork+handshake
CPU work
parent reap wait
what this measures
Each stream runs a tight integer LCG loop — working set is one CPU register, no memory access,
no shared data. Speedup = sum(stream CPU time) / wall-clock elapsed. Efficiency = speedup / (workers+1).
100% efficiency means perfect linear scaling; less than 100% is the cost of serial fork setup,
reap tail, SMT/core contention.