Table 9 Best running time (milliseconds) of each implementation
From: Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA
n | CS-1 OMP 12T | CS-4 N32:P8 | CS-1 CUDA 4GPUs |
|---|---|---|---|
220 | 13.353 | 119.741 | 9.033 |
221 | 26.081 | 79.335 | 15.794 |
222 | 46.429 | 23.279 | 15.661 |
223 | 84.330 | 28.399 | 15.053 |
224 | 157.892 | 33.242 | 16.036 |
225 | 297.038 | 46.379 | 23.632 |
226 | 614.651 | 66.719 | 30.764 |
227 | 1355.126 | 111.906 | 55.126 |
228 | 2362.273 | 203.811 | 103.174 |
229 | 7082.654 | 17,766.883 | 204.072 |