Design and implementation of a practical I/O-efficient shortest paths algorithm

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 85-96

  Meyer, Ulrich ^a   Osipov, Vitaly ^b  

^a GOETHE UNIVERSITY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FLASH MEMORY; GRAPHIC METHODS;

DESIGN AND IMPLEMENTATIONS; EXTERNAL MEMORY; INTEGER WEIGHTS; RANDOM EDGE WEIGHTS; SHORTEST PATH; SINGLE SOURCE SHORTEST PATHS; SOLID STATE DISKS; SPARSE GRAPHS;

GRAPH THEORY;

EID: 74049148938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.9     Document Type: Conference Paper

References (30)

1. Online resources of the 9th DIMACS Implementation Challenge: Shortest Paths, 2006. http://www.dis.uniroma1.it/∼challenge9/.
2. The boost graph library: user guide and reference manual. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002.
3. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Com- munications of the ACM, 31(9), pages 1116-1127, 1988.
4. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory BFS algorithms. In SODA, pages 601-610. ACM Press, 2006.
5. D. Ajwani, I. Malinger, U. Meyer, and S. Toledo. Characterizing the performance of flash memory storage devices and its impact on algorithm design. In Proc. 7th Int. Workshop on Experimental Algo- rithms (WEA), volume 5038 of Lecture Notes in Computer Science, pages 208-219. Springer, 2008.
6. D. Ajwani, U. Meyer, and V. Osipov. Improved external memory BFS implementation. In Proc. Workshop on Algorithm Engineering and Experi- ments, ALENEX. SIAM, 2007.
7. L. Arge, G. S. Brodal, and L. Toma. On externalmemory MST, SSSP and multi-way planar graph separation. J. Algorithms, 53(2):186-206, 2004.
8. J. Barnat, L. Brim, S. Edelkamp, D. Sulewski, and P. Simecek. Can flash memory help in model checking? In Proc. 13th International Workshop on Formal Methods for Industrial Critical Systems, pages 159-174, 2008.
9. H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes. In transit to constant time shortestpath queries in road networks. In Proc. Work- shop on Algorithm Engineering and Experiments, ALENEX. SIAM, 2007.
10. M. Chen, R. A. Chowdhury, V. Ramachandran, D. L. Roche, and L. Tong. Priority queues and Dijkstra's algorithm. Technical Report TR-07-54, The University of Texas at Austin, Department of Computer Sciences, Oct. 2007.
11. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In SODA, pages 139-149, 1995.
12. R. Dementiev, L. Kettner, and P. Sanders. : Standard template library for XXL data sets. In G. S. Brodal and S. Leonardi, editors, ESA, volume 3669 of Lecture Notes in Computer Science, pages 640-651. Springer, 2005.
13. R. Dementiev, P. Sanders, D. Schultes, and J. F. Sibeyn. Engineering an external memory minimum spanning tree algorithm. In J.-J. Ĺevy, E.W. Mayr, and J. C. Mitchell, editors, IFIP TCS, pages 195- 208. Kluwer, 2004.
14. E. W. Dijkstra. A note on two problems in connexion with graphs. Num. Math., 1:269-271, 1959.
15. E. Gal and S. Toledo. Algorithms and data structures for flash memories. ACM Computing Surveys, 37(2):138-163, 2005.
16. A. Goldberg and R. Werneck. Computing pointto- point shortest paths from external memory. In Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05). SIAM, 2005.
17. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In SPDP, pages 169-176, Los Alamitos, CA, USA, 1996. IEEE Computer Society.
18. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In R. H. Mohring and R. Raman, editors, ESA, volume 2461 of Lecture Notes in Computer Science, pages 723- 735. Springer, 2002.
19. U. Meyer, P. Sanders, and J. Sibeyn (Eds.). Al- gorithms for Memory Hierarchies, volume 2625 of LNCS. Springer, 2003.
20. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths. In G. D. Battista and U. Zwick, editors, ESA, volume 2832 of Lecture Notes in Computer Science, pages 434-445. Springer, 2003.
21. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths with unbounded edge lengths. In Y. Azar and T. Erlebach, editors, ESA, volume 4168 of Lecture Notes in Computer Science, pages 540-551. Springer, 2006.
22. K. Munagala and A. G. Ranade. I/O-complexity of graph algorithms. In SODA, pages 687-694, 1999.
23. B. Sach and R. Clifford. An empirical study of cache-oblivious priority queues and their application to the shortest path problem. Available online under http://www.cs.bris.ac.uk/∼sach/COSP/, Feb. 2008.
24. P. Sanders. Fast priority queues for cachedmemory. ACM Journal of Experimental Algorithms, 5:7, 2000.
25. P. Sanders, D. Schultes, and C. Vetter. Mobile route planning. In Proc. 16th Annual European Symposium on Algorithms, volume 5193 of LNCS, pages 732-743. Springer, 2008.
26. J. F. Sibeyn. From parallel to external list ranking. Technical report, Max Planck Institut fur Informatik, Saarbrucken, Germany, 1997.
27. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM computing Surveys, 33, pages 209-271, 2001. Revised version (April 2008) available online at http://www.cs.purdue.edu/homes/ ∼jsv/Papers/Vit.IO/survey.pdf.
28. The stanford webbase project. http://www-diglib.stanford.edu/ ∼testbed/doc2/WebBase/.
29. C.-H. Wu, L.-P. Chang, and T.-W. Kuo. An efficient R-tree implementation over flash-memory storage systems. In Proc. 11th ACM International Symposium on Advances in Geographic Informa- tion Systems, pages 17-24, 2003.
30. C.-H. Wu, T.-W. Kuo, and L.-P. Chang. An efficient B-tree layer implementation for flash-memory storage systems. ACM Transactions on Embedded Computing Systems, 6(3), 2007.