Internet Archive Scholar

A Linear-C implementation of Dijkstra's algorithm

Chung-Hsing Hsu, Don Smith, Saul Levy
1996

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (193.3 kB)
https://web.archive.org/web/20200212231044/https://rucore.libraries.rutgers.edu/rutgers-lib/59604/PDF/1/

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Linear-C is a data-parallel extension to C. In this report we show, by implementing Dijkstra's algorithm in Linear-C to solve the shortest-paths problem, that (1) data-parallelism in Dijkstra's algorithm can be easily expressed in Linear-C, (2) even a small amount of data parallelism can speed up the whole algorithm substantially, and (3) the algorithm, the data representation, and the efficiency are closely inter-related. Three implementations are provided, each with a different level of data
more » ... arallelism exploited. The programs are explained, their time complexities are analyzed, and their strength and weakness in efficiency are compared.
doi:10.7282/t3-g4x0-zp04 fatcat:byzo7x7xlvfb3jtvsid25tqsjm
Citation

Chung-Hsing Hsu, Don Smith, Saul Levy. "A Linear-C implementation of Dijkstra's algorithm." (1996)