Abstract
We report on experiments with graph algorithms which were designed for the coarse grained multicomputer (CGM) model. The implementation was based on the message-passing paradigm and uses PVM and/or MPI as communication interfaces.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputer and BSP. In Proceedings of the 24th International Colloquium ICALP’97, volume 1256 of LNCS, pages 390–400, 1997.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pages 1–12, 1993.
F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputer. In ACM 9th Symposium on Computational Geometry, pages 298–307, 1993.
F. Dehne and S. W. Song. Randomized parallel list ranking for distributed memory multiprocessors. In Springer Verlag, (editor), Proc. 2nd Asian Computing Science Conference ASIAN’96, volume 1179 of LNCS, pages 1–10, 1996.
A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251–267, 1994.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
M.T. Goodrich. Communication-efficient parallel sorting. In Proc. of 28th Symp. on Theory of Computing, 1996.
I. Guérin Lassous and J. Gustedt. List ranking on PC clusters. Technical Report 3869,I.N.R.I.A., 2000.
I. Guérin Lassous, J. Gustedt, and M. Morvan. Feasibility, Portability, Predictability and Efficiency: Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. Technical Report RR-3885, INRIA Lorraine, 2000. http://www.inria.fr/RRRT/publicationsfra.html.
J. Gustedt, M. Morvan, and L. Viennot. A compact data structure and parallel algorithms for permutation graphs. In M. Nagl, (editor), WG’ 95 21st Workshop on Graph-Theoretic Concepts in computer Science, 1995. Lecture Notes in Computer Science 1017.
J. Jájá. An Introduction to Parallel Algorithm. Addison Wesley, 1992.
F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, 1985.
M. Reid-Miller. List ranking and list scan on the Cray C-90. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 104–113, 1994.
J. F. Sibeyn, F. Guillaume, and T. Seidel. Practical Parallel List Ranking. Journal of Parallel and Distributed Computing, 56:156–180, 1999.
L. Valiant. A bridging model for parallel computation. Communications of the ACM, Vol. 33(8):103–111, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassous, I.G., Gustedt, J., Morvan, M. (2000). Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI. In: Dongarra, J., Kacsuk, P., Podhorszki, N. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2000. Lecture Notes in Computer Science, vol 1908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45255-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-45255-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41010-2
Online ISBN: 978-3-540-45255-3
eBook Packages: Springer Book Archive