Advanced shortest paths algorithms on a massively-multithreaded architecture

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Crobak, Joseph R ^a   Berry, Jonathan W ^b   Madduri, Kamesh ^c   Bader, David A ^c  

^a RUTGERS UNIVERSITY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; GRAPH THEORY; PROBLEM SOLVING; SCALABILITY; SOFTWARE ARCHITECTURE;

ECONOMIC TRANSACTION NETWORKS; MULTITHREADED ARCHITECTURE; MULTITHREADED GRAPH LIBRARY (MTGL); SHORTEST PATHS ALGORITHMS; SINGLE SOURCE SHORTEST PATH (SSSP); THORUPS ALGORITHM;

ALGORITHMS;

EID: 34548784575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370687     Document Type: Conference Paper

References (14)

1. H. Bast, S.Fuhke, D. Matijevic, P. Sanders, and D. Schuttes, In transit to constant time shortest-path queries in,road networks. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007.
2. J. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Graph software development and performance on the MTA-2 and Eldorado. In Proc. Cray User Group meeting (CUG 2006), Lugano, Switzerland, May 2006. CUG Proceedings.
3. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining, In Proc. 4th SIAM Intl, Conf. on Data Mining (SDM), Orlando, FL, April 2004. SIAM.
4. Cray, Inc. The XMT platform, http://www.ccay. com/products/xmt/, 2006.
5. C. Demetrescu, A. Goldberg, and D. Johnson. 9thDIMACS implementation challenge.-Shortest Paths, http://www. dis.uriromal.it/~challenge9/, 2006, [6] E, Dijkstra, A note on two problems in connection with graphs. Numerical Mathematics, 1(4):269-271, 1959,
6. A. V. Goldberg. A simple shortest path algorithm with linear average time. Lecture Notes in Computer Science, 2161, 2001.
7. T. Hagerup. Improved shortest paths on the word ram, In ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 61-72, London, UK, 2000. Springer-Verlag.
8. S. Knopp, P. Sanders, D. Schultes, F. Schulz, and D. Wagner. Computing many-to-many shortest paths using: highway hierarchies,. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007.
9. K. Madduri, D. Bader, J. Berry, and J. Crobak. Parallel shortest path algorithms for solving large-scale instances. Technical report, Georgia Institute of Technology, September 2006.
10. K. Madduri, D. Bader, J. Berry, and J. Crobak, An experimental study of aparallel shortest path algorithm for solving large-scale graph instances. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007.
11. U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In European Symposium on Algorithms, pages 393-404, 1998,
12. S.Pettie and V.Ramachandran. Computing shortest paths with comparisons and additions. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02). SIAM, 6-8 2002.
13. Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm. J. Algs., 3:(1):57-67, 1982.
14. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46(3):362-394, 1999.