A Hardware Implementation of PRAM and its Performance Evaluation
A PRAM (Parallel Random Access Machine)  is the parallel computational model most notable for supporting the parallel algorithmic theory. It consists of a number of processors sharing a common memory. The processors communicate by exchanging data through a shared memory cell. Each processor can access any memory cell at one unit of time and all processors operate synchronously under the control of a common clock. These facts make the model a very advantageous platform for considering the inherent parallelism of problems. How ever, the development of parallel computers which fit this model has not quite matched the theoretical requests. The researches focusing on the reduction of this gap has been carried out [2, 5, 6, 7, 8, 9]. However, most of them give only theoretical analysis; the implementation of the PRAM on hardware level is seldom seen.
KeywordsMemory Cell Shared Memory Memory Unit Access Request Processor Unit
Unable to display preview. Download preview PDF.
- 1.K. C. Chang: “Digital Design and Modeling with VHDL and Synthesis”, IEEE Computer Society Press (1996).Google Scholar
- 2.D. Culler, et al: “Towards a realistic model of parallel computation”, in Proc.4th ACM SIGPLAN Sym. on PPPP (1993).Google Scholar
- 3.M. Imai, Y. Hayakawa, H. Kawanaka, W. Chen, K. Wada: “Design and implementation of PRAM on Hardware Level”, Technical report TR-99-01 in Wada Lab. of Dept. of Elec. & Comput. Eng., Nagoya Institute of Technology, Japan (1999).Google Scholar
- 4.Joseph JáJá: “An Introduction to Parallel Algorithms”, Addison-Wesley (1992).Google Scholar
- 5.V. Leppänen, M. Penttonen: “Work-Optimal Simulation of PRAM Models on Meshes”, Nordic Journal on Computing, 2(1):51–69(1995).Google Scholar
- 8.K. Sato, T. Kurozawa, K. Honda, K. Nakano, T. Hayashi: “Implementing the PRAM Algorithms in the Multithread Architecture and Evaluating the Performance”, IPSJ AL, 61(6):39–46 (1988).Google Scholar
- 9.L. G. Valiant: “A bridging model for parallel computation”, CACM 33,8 (1990).Google Scholar