A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment

Authors:
T. Srinivasan;R. Balakrishnan;S. A. Gangadharan;V. Hayawardh
Affiliations:
Department of Computer Science and Engineering, Sri Venkateswara College of Engineering, Pennalur, Sriperambudur 602105, TN, India;Department of Computer Science and Engineering, Sri Venkateswara College of Engineering, Pennalur, Sriperambudur 602105, TN, India;Department of Computer Science and Engineering, Sri Venkateswara College of Engineering, Pennalur, Sriperambudur 602105, TN, India;Department of Computer Science and Engineering, Sri Venkateswara College of Engineering, Pennalur, Sriperambudur 602105, TN, India
Venue:
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Year:
2007

Citing 0
Cited 1

A task parallel algorithm for finding all-pairs shortest paths using the GPU

International Journal of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Embedded systems such as mobile phones widely adopt heterogeneous dual-core processors to improve the performance and reduce the cost and power consumption. Considering mobile devices that are usually battery-operated, one of the critical issues for ...