Abstract

The Single Source Shortest Path (SSSP) problem has been solved using various algorithms. We focus on accelerating a well known SSSP algorithm, the Dijkstra's algorithm using a multi-core CPU. We achieve acceleration by using the iParallel kernel, a hybrid kernel that runs on the sequential as well as parallel kernels intelligently. Our experimental results help find an optimal threshold to exploit parallelism for different sizes of the search terrain. We have achieved an overall acceleration of −48% and −51% on a dual-core ARM A9 processor and a 16-core Epiphany co-processor respectively.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.