The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized PRAM Simulation Using T9000 Transputers
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
| Hi-index | 0.00 |
The parallel random access machine (PRAM) is the most commonly used general-purpose machine model for describing parallel computations. Unfortunately the PRAM model is not physically realizable, since on large machines a parallel shared memory access can only be accomplished at the cost of a significant time delay. A number of PRAM simulation algorithms are known. The algorithms allow execution of PRAM programs on more realistic parallel machines. We study the randomized simulation of an exclusive read, exclusive write (EREW) PRAM on a module parallel computer (MPC). The simulation is based on utilizing universal hashing. The optimally efficient simulation involving parallel slackness is also investigated. The results of our experiments performed on the MPC built upon IMS T9000 transputers throw some light on the question whether using the PRAM model in parallel computations is practically viable given the present state of transputer technology.