Splits the three heavy paths across scoped threads and reports the speedup and the efficiency against the thread count, with the serial time taken as the fastest of several runs so a scheduling hiccup cannot inflate the reference every number is divided by. Constellation propagation and access search are embarrassingly parallel and scale as expected until the thread count passes eight, where the machine stops gaining. Topology construction does not scale at all, and the split line shows why: the geometric visibility test is two milliseconds while folding the visible pairs into the graph is four hundred, because each insertion scans the edges already stored. |
||
|---|---|---|
| .. | ||
| workflows | ||