Table 4 Running times (milliseconds) of sequential implementation
From: Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA
n | CS-5 | CS-4 | CS-1 | CS-3 | CS-2 |
|---|---|---|---|---|---|
220 | 35.811 | 71.143 | 57.314 | 59.100 | 31.517 |
221 | 69.225 | 141.295 | 110.836 | 114.250 | 62.986 |
222 | 135.859 | 283.747 | 219.730 | 225.275 | 126.487 |
223 | 284.376 | 636.522 | 531.464 | 502.136 | 250.795 |
224 | 543.696 | 1305.605 | 1063.938 | 1005.549 | 501.978 |
225 | 1225.326 | 2492.813 | 2114.072 | 2005.769 | 1004.222 |
226 | 2186.893 | 6825.944 | 4105.771 | 4012.655 | 2022.964 |
227 | 4985.319 | – | 8272.913 | 16,682.755 | 4030.542 |
228 | – | – | 18,931.466 | – | 20,327.877 |
229 | – | – | 42,466.062 | – | – |