Efficient parallel graph algorithms for coarse grained multicomputer and BSP

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

Volumn 1256, Issue , 1997, Pages 390-400

  Caceres E ^a   Dehne, F ^b   Ferreira, A ^c   Flocchini, P ^d   Rieping, I ^e   Roncato, A ^f   Santoro, N ^b   Song, S W ^g  

^a FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITÉ DE LYON   (France)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

^e UNIVERSITY OF PADERBORN   (Germany)

^f Univ óf São Paulo ^*  (Italy)

^g UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PARALLEL ALGORITHMS; PETROLEUM RESERVOIR EVALUATION; WELL TESTING;

BULK SYNCHRONOUS PARALLEL; COARSE-GRAINED PARALLELS; COMMUNICATION ROUNDS; CONNECTED COMPONENT; EAR DECOMPOSITION; LOWEST COMMON ANCESTORS; PARALLEL GRAPH ALGORITHMS; PERFECT ELIMINATION ORDER;

FORESTRY;

EID: 84951140804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_195     Document Type: Conference Paper

References (35)

1. S.G. AM, Parallel Computation, Prentice Hall, 1997.
2. R.J. Anderson, and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
3. A. Baumker and W. Dittrich, "Parallel Algorithms for Image Processing: Practical Algorithms with Experiments," International Parallel Processing Symposium, IEEE Computer Society Press, 1996, pp. 429-433.
4. G.E. Blelloch, CE. Leiserson, B.M. Maggs, C.G. Plaxton, "A Comparison of Sorting Algorithms for the Connection Machine CM-2.," in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1991, pp. 3-16.
5. E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Ron-cato, N. Santoro, and S.W. Song, "Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP,", on-line Postscript at http://www.scs.carleton.ca/scs/faculty/dehne.html.
6. R. Cole, "Parallel merge sort," SIAM J. Comput., 17(4), 1988, pp. 770-785.
7. R. Cole and U. Vishkin, "Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time", SIAM Journal of Computing, Vol. 17, No. 1, 1988.
8. F. Dehne, A. Fabri, and A. Rau-Chaplin, "Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers," in Proc. ACM 9th Annual Computational Geometry, pages 298-307, 1993.
9. F. Dehne, A. Fabri, and C. Kenyon, "Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time," in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, pages 586-593, 1994.
10. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, "A randomized parallel 3D convex hull algorithm for coarse grained multicomputers," in Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA'95), pp. 27-33, 1995.
11. F. Dehne, S.W. Song, "Randomized parallel list ranking for distributed memory multiprocessors," in Proc. Second Asian Computing Science Conference, ASIAN'96, Singapore, Dec. 1996, Springer Lecture Notes in Computer Science 1179, pp. 1-10.
12. X. Deng, "A Convex Hull Algorithm for Coarse Grained Multiprocessors," in Proc. 5th International Symposium on Algorithms and Computation, 1994.
13. X. Deng and P. Dymond, "Efficient Routing and Message Bounds for Optimal Parallel Algorithms," in Proc. Int. Parallel Proc. Symp., 1995.
14. X. Deng and N. Gu, "Good Programming Style on Multiprocessors," in Proc. IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 538-543.
15. G.A. Dirac. "On rigid circuit graphs". Abh. Math. Sem. Univ. Hamburg 25, 1961, pp. 71-76.
16. A. Ferreira, A. Rau-Chaplin, and S. Ubeda, "Scalable 2d convex hull and triangula-tion algorithms for coarse-grained multicomputers," in Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing-SPDP'95, pages 561-569, San Antonio (USA), October 1995. IEEE Press.
17. A.V. Gerbessiotis and L.G. Valiant, "Direct Bulk-Synchronous Parallel Algorithms," in Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621, 1992, pp. 1-18.
18. M.T. Goodrich, "Communication efficient parallel sorting," ACM Symposium on Theory of Computing (STOC), 1996.
19. Ja Ja, An Introduction to Parallel Algorithms, Addison Wesley, 1992.
20. P. Klein. "Efficient Parallel Algorithms for Chordal Graphs". Proc. É9th Symp. Found, of Comp. Sci., FOCS 1989, pp. 150-161.
21. P. Klein. "Parallel Algorithms for Chordal Graphs". In Synthesis of parallel algorithms, J. H. Reif (editor). Morgan Kaufmann Publishers, 1993, pp. 341-407.
22. Hui Li, and K. C. Sevcik, "Parallel Sorting by Overpartitioning," in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1994, pp. 46-56.
23. Y. Maon, B. Schieber, U. Vishkin. "Parallel ear decomposition search (EDS) and st-numbering in graphs". Theoretical Computer Science, vol. 47, 1986, pp. 277-298.
24. G.L. Miller, J.H. Reif, "Parallel tree contraction and its application," IEEE Symp. on Foundations of Computer Science, 1985, pp. 478-489.
25. G. L. Miller, V. Ramachandran. "Efficient parallel ear decomposition with applications", manuscript, MSRI, Berkeley, January 1986.
26. V. Ramachandran. "Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity", in [28], pp. 276-340.
27. M. Reid-Miller, "List ranking and list scan on the Cray C-90," in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1994, pp. 104-113.
28. J. H. Reif (editor), Synthesis of parallel algorithms, Morgan Kaufmann Publishers, 1993.
29. D.J. Rose, R.E. Tarjan, and G.S. Lueker. "Algorithmic Aspects of Vertex Elimination on Graphs". SIAM J. Comp. 5, 1976, pp. 266-283.
30. Y. Shiloch, U. Vishkin, "An O(logn) parallel connectivity algorithm," Journal of Algorithms, 3(1), pp. 57-67, 1983.
31. L. Snyder, "Type architectures, shared memory and the corollary of modest potential," Annu. Rev. Comput. Sci. 1, 1986, pp. 289-317.
32. R.E. Tarjan, U. Vishkin, "An efficient parallel biconnectivity algorithm," SIAM J. Comput., 14(4), 1985, pp. 862-874.
33. L. Valiant, "A bridging model for parallel computation," Communications of the ACM, Vol. 33, No. 8, 1990.
34. L.G. Valiant et al., "General Purpose Parallel Architectures," Handbook of Theoretical Computer Science, Edited by J. van Leeuwen, MIT Press/Elsevier, 1990, pp.943-972.
35. H. Whitney. “Non-separable and planar graphs”. Trans. Amer. Math. Soc. 34, 1932, pp. 339-362.