Verification of the correctness of parallel algorithms is often omitted in the works from the parallel computation field. In this paper, we discuss in detail how to show that a parallel algorithm is correct. This process involves proving its safety and liveness. In our case study, we prove the correctness of our two parallel algorithms for the NP-hard pickup and delivery problem with time windows. Both algorithms (for minimizing the number of routes and the travel distance) were already shown to be extremely efficient in practice—the implementations were thoroughly examined using the famous Li and Lim’s benchmark dataset.
CITATION STYLE
Nalepa, J., & Blocho, M. (2018). Verification of correctness of parallel algorithms in practice. In Studies in Computational Intelligence (Vol. 717, pp. 135–151). Springer Verlag. https://doi.org/10.1007/978-3-319-59861-1_9
Mendeley helps you to discover research relevant for your work.