Handling graphs according to a coarse grained approach: Experiments with PVM and MPI

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

Volumn 1908, Issue , 2000, Pages 72-79

  Lassous, Isabelle Guérin ^a   Gustedt, Jens ^b   Morvan, Michel ^c  

^a INRIA ROCQUENCOURT   (France)

^b LORIA   (France)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; VIRTUAL MACHINE;

COARSE-GRAINED; COARSE-GRAINED APPROACHES; COMMUNICATION INTERFACE; GRAPH ALGORITHMS; MESSAGE PASSING PARADIGMS; MULTICOMPUTERS;

MESSAGE PASSING;

EID: 84956974040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45255-9_13     Document Type: Conference Paper

References (16)

1. 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.
2. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press,1990
3. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken: Towardsa Realistic Model of Parallel Computation. In Proceeding of 4-th ACMSIGPLAN Symp. on Principles and Practisesof Parallel Programming, pages 1–12, 1993
4. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable Parallel Geometric Algorithmsfor Coarse Grained Multicomputer. In ACM 9th Symposium on ComputationalGeometry, pages 298–307, 1993
5. F. Dehne and S. W. Song. Randomizedparallel list ranking for distributed memorymultiprocessors. In Springer Verlag,editor, Proc. 2nd Asian Computing ScienceConference ASIAN’96, volume 1179of LNCS, pages 1–10, 1996
6. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and DistributedComputing, 22:251–267, 1994
7. M. C. Golumbic. Algorithmic Graph Theoryand Perfect Graphs. Academic Press,New York, 1980
8. M.T. Goodrich. Communication-efficientparallel sorting. In Proc. of 28th Symp. onTheory of Computing, 1996
9. I. Guérin Lassous and J. Gustedt. Listranking on PC clusters. Technical Report3869, I.N.R.I.A., 2000
10. I. Guérin Lassous, J. Gustedt, and M. Morvan. Feasibility, Portability,Predictability and Efficiency: FourAmbitious Goals for the Design andImplementation of Parallel CoarseGrained Graph Algorithms. TechnicalReport RR-3885, INRIA Lorraine, 2000. http://www.inria.fr/RRRT/publicationsfra.html
11. J. Gustedt, M. Morvan, and L. Viennot. A compact data structure and parallelalgorithms for permutation graphs. In M. Nagl, editor, WG’95 21st Workshopon Graph-Theoretic Concepts in computerScience, 1995. Lecture Notes inComputer Science 1017
12. J. Jájá. An Introduction to Parallel Algorithm. Addison Wesley, 1992
13. F.P. Preparata and M.I. Shamos. ComputationalGeometry: an Introduction.Springer-Verlag, 1985
14. M. Reid-Miller. List ranking and list scanon the Cray C-90. In Proc. ACM Symp.on Parallel Algorithms and Architectures, pages 104–113, 1994
15. J. F. Sibeyn, F. Guillaume, and T. Seidel. Practical Parallel List Ranking. Journalof Parallel and Distributed Computing, 56:156–180, 1999
16. L. Valiant. A bridging model for parallelcomputation. Communications of the ACM, Vol. 33(8):103–111, 1990.