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

### Cached

### Download Links

- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [ftp.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 14 - 3 self |

### BibTeX

@MISC{Hsu95implementationof,

author = {Tsan-sheng Hsu and Vijaya Ramachandran and Nathaniel Dean},

title = {Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### 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...