Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4742 LNCS, Issue , 2007, Pages 137-147

  Cong, Guojing ^a   Bader, David A ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Biconnected components; Minimum spanning tree; Shared memory; Spanning tree

Indexed keywords

INTEGRATED CIRCUIT DESIGN; MULTIPROCESSING SYSTEMS; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

BICONNECTED COMPONENTS; HIGH PERFORMANCE COMPUTING; LARGE-SCALE GRAPH PROBLEMS; MINIMUM SPANNING TREES; PARALLEL GRAPH ALGORITHMS; SHARED MEMORY; SPANNING TREE; SYMMETRIC MULTI-PROCESSORS;

GRAPH ALGORITHMS;

EID: 38149048421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74742-0_15     Document Type: Conference Paper

References (23)

1. Bader, D.A., Cong, G.: Efficient parallel algorithms for multi-core and multiprocessors. In: Rajasekaran, S., Reif, J. (eds.) Handbook of Parallel Computing: Models, Algorithms, and Applications, CRC press, Boca Raton, USA (2007)
2. Bader, D.A., Cong, G., Madduri, K.: Design of multithreaded algorithms for combinatorial problems. In: Rajasekaran, S., Reif, J. (eds.) Handbook of Parallel Computing: Models, Algorithms, and Applications, CRC press, Boca Raton, USA (2007)
3. Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: IPDPS 2004. Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, New Mexico (2004)
4. Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: IPDPS 2004. Proc. 18th Int'l Parallel and Distributed Processing Symp., Santa Fe, New Mexico (2004)
5. Cong, G., Bader, D.: An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs). In: IPDPS 2005. Proceedings of the 19th International Parallel and Distributed Processing Symposium, Denver, Colorado (2005)
6. Greiner, J.: A comparison of data-parallel algorithms for connected components. In: SPAA-94. Proc. 6th Ann. Symp. Parallel Algorithms and Architectures, Cape May, NJ, pp. 16-25 (1994)
7. Hsu, T.S., Ramachandran, V., Dean, N.: Parallel implementation of algorithms for finding connected components in graphs. In: Bhatt, S.N. (ed.) Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, pp. 23-41 (1997)
8. Krishnamurthy, A., Lumetta, S.S., Culler, D.E., Yelick, K.: Connected components on distributed memory machines. In: Bhatt, S.N. (ed.) Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, pp. 1-21. American Mathematical Society, Providence, RI (1997)
9. Goddard, S., Kumar, S., Prins, J.: Connected components algorithms for mesh-connected parallel computers. In: Bhatt, S.N. (ed.) Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, pp. 43-58 (1997)
10. Chung, S., Condon, A.: Parallel implementation of Borůvka's minimum spanning tree algorithm. In: IPPS'96. Proc. 10th Int'l Parallel Processing Symp., pp. 302-315 (1996)
11. Dehne, F., Götz, S.: Practical parallel algorithms for minimum spanning trees. In: Workshop on Advances in Parallel and Distributed Systems, West Lafayette, IN, pp. 366-371 (1998)
12. Woo, J., Sahni, S.: Load balancing on a hypercube. In: Proc. 5th Int'l Parallel Processing Symp., Anaheim, CA, pp. 525-530. IEEE Computer Society Press, Los Alamitos (1991)
13. Kruskal, C., Rudolph, L., Snir, M.: Efficient parallel algorithms for graph problems. Algorithmica 5, 43-64 (1990)
14. Culler, D.E., Karp, R.M., Patterson, D.A., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: Towards a realistic model of parallel computation. In: 4th Symp. Principles and Practice of Parallel Programming, ACM SIGPLAN, pp. 1-12. ACM Press, New York (1993)
15. Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33, 103-111 (1990)
16. JáJá, J.: An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York (1992)
17. Shiloach, Y., Vishkin, U.: An O(log n) parallel connectivity algorithm. J. Algs. 3, 57-67 (1982)
18. Tarjan, R., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM J. Computing 14, 862-874 (1985)
19. Arge, L., Bender, M., Demaine, E., Holland-Minkley, B., Munro, J.: Cache-oblivious priority queue and graph algorithm applications. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Canada, pp. 268-276. ACM Press, New York (2002)
20. Bender, M., Demaine, E., Farach-Colton, M.: Cache-oblivious search trees. In: FOCS-00. Proc. 41st Ann. IEEE Symp. Foundations of Computer Science, Redondo Beach, CA, pp. 399-409. IEEE Press, Los Alamitos (2000)
21. Helman, D.R., JáJá, J.: Designing practical efficient algorithms for symmetric multiprocessors. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX1999. LNCS, vol. 1619, pp. 37-56. Springer, Heidelberg (1999)
22. Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: IPDPS 2002. Proc. Int'l Parallel and Distributed Processing Symp., Fort Lauderdale, FL (2002)
23. Chiang, Y.J., Goodrich, M., Grove, E., Tamassia, R., Vengroff, D., Vitter, J.: Externalmemory graph algorithms. In: Proceedings of the 1995 Symposium on Discrete Algorithms, pp. 139-149 (1995)