English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Parallel and External List Ranking and Connected Components on a Cluster of Workstations

MPS-Authors
/persons/resource/persons44879

Lambert,  Oliver
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn,  Jop F.
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Lambert, O., & Sibeyn, J. F. (1999). Parallel and External List Ranking and Connected Components on a Cluster of Workstations. In S. Q. Zheng (Ed.), Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99) (pp. 454-460). Anaheim, USA: IASTED.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-35F6-4
Abstract
Improved parallel, external and parallel-external algorithms for list-ranking and computing the connected components of a graph are presented. These algorithms are implemented and tested on a cluster of workstations using the C programming language and mpich, a portable implementation of the MPI (Message-Passing Interface) standard.