Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing

Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Tsan-sheng Hsu , Vijaya Ramachandran , Nathaniel Dean

Citations:

10 - 3 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing	user correction - Legacy Corrections
AUTHOR NAME	Tsan-sheng Hsu	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Sciences; University of Texas at Austin	SVM HeaderParse 0.2
AUTHOR ADDR	Austin, TX 78712	SVM HeaderParse 0.1
AUTHOR NAME	Vijaya Ramachandran	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Sciences; University of Texas at Austin	SVM HeaderParse 0.2
AUTHOR ADDR	Austin, TX 78712	SVM HeaderParse 0.1
AUTHOR NAME	Nathaniel Dean	SVM HeaderParse 0.1
AUTHOR AFFIL	Combinatorics and Optimization Research; Bell Communications Research	SVM HeaderParse 0.2
AUTHOR ADDR	Morristown, NJ 07960	SVM HeaderParse 0.1
ABSTRACT	We describe our implementation of several PRAM graph algorithms on the massively parallel computer MasPar MP-1 with 16,384 processors. Our implementation incorporated virtual processing and we present extensive test data. In a previous project [13], we reported the implementation of a set of parallel graph algorithms with the constraint that the maximum input size was restricted to be no more than the physical number of processors on the MasPar. The MasPar language MPL that we used for our code does not support virtual processing. In this paper, we describe a method of simulating virtual processors on the MasPar. We re-coded and fine-tuned our earlier parallel graph algorithms to incorporate the usage of virtual processors. Under the current implementation scheme, there is no limit on the number of virtual processors that one can use in the program as long as there is enough main memory to store all the data required during the computation. We also give two general optimization techniq...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	38 found	ParsCit 1.0