.  Table 00.0  Speedups for multiple-walk cooperative-thread implementations of GRASP with path-relinking on instances B-S 00.0, B-S 00.0, B-S 00.0, and B-S 00.0, with target values 0, 0, 0, and 0, respectively. Average speedups were computed over 00 runs. | Number of processors  ---|---   |  0 | 0 | 0 | 00  Problem | speedup | efficiency | speedup | efficiency | speedup | efficiency | speedup | efficiency  B-S 00.0 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 00.00 | 0.00  B-S 00.0 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 00.00 | 0.00  B-S 00.0 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 00.00 | 0.00  B-S 00.0 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 00.00 | 0.00  average | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 00.00 | 0.00  Fig. 00.0  Average speedups on 0, 0, 0, and 00 processors for multiple-walk cooperative-thread parallel GRASP with path-relinking on AP0 instances B-S 00.0, B-S 00.0, B-S 00.0, and B-S 00.0.  