A parallel external-memory frontier breadth-first traversal algorithm for clusters of workstations

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2006, Pages 531-538

  Niewiadomski, Robert ^a   Amaral, José Nelson ^a   Holte, Robert C ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

INTERNAL MEMORY; PARALLEL EXTERNAL-MEMORY; SEQUENTIAL COUNTERPARTS;

PARALLEL ALGORITHMS;

EID: 34547418590     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2006.9     Document Type: Conference Paper

References (17)

1. A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, and D. A. Patterson. High-performance sorting on networks of workstations. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 243-254, 1997.
2. R. H. Arpaci-Dusseau, A. C. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, and D. A. Patterson. The architectural costs of streaming I/O: a comparison of workstations, clusters, and SMPs. In Proceedings of the Fourth International Symposium on High-Performance Computer Architecture, pages 90-101, 1998.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.
4. A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. Journal of Artificial Intelligence Research, 22:279-318, 2004.
5. P. Hart, N. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions of Systems Science and Cybernetics, SSC-4(2):100-107, July 1968.
6. E. M. Clarke Jr., O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999.
7. R. E. Korf. A divide and conquer bidirectional search: first results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1184-1189, 1999.
8. R. E. Korf. Delayed duplicate detection: extended abstract. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pages 1539-1541, 2003.
9. R. E. Korf. Best-first frontier search with delayed duplicate detection. In Proceedings of the Twentieth National Conference on Artificial Intelligence, pages 650-657, 2004.
10. R. E. Korf and P. Schultze. Large-scale parallel breadth-first search. In Proceedings of the Twenty-First National Conference on Artificial Intelligence, pages 1380-1385, 2005.
11. R. E. Korf and W. Zhang. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 910-916, 2000.
12. P. Larson and G. Graefe. Memory management during run generation in external sorting. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 472-483, 1998.
13. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, Advanced Lectures, volume 2625 of Lecture Notes in Computer Science. Springer, 2003.
14. H. Shi and J. Schaeffer. Parallel sorting by regular sampling. Journal of Paralle and Distibuted Computing, 14(4):361-372, 1992.
15. J. S. Vitter and E. A.M. Shriver. Algorithms for parallel memory I: two-level memories. Technical report, Brown University, 1992.
16. L. Zheng and P. Larson. Speeding up external mergesort. IEEE Transactions on Data and Knowledge Engineering, 8(2):322-332, 1996.
17. R. Zhou and E. A. Hansen. Breadth-first heuristic search. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pages 92-100, 2004.