首页 | 本学科首页   官方微博 | 高级检索  
     


Efficient PRAM simulation on a distributed memory machine
Authors:R M Karp  M Luby  F Meyer auf der Heide
Affiliation:(1) Computer Science Department, University of Washington, USA;(2) International Computer Science Institute, 94704 Berkeley, CA, USA;(3) University of California, 94720 Berkeley, CA, USA;(4) Heinz Nixdorf Institute and Computer Science Department, University of Paderborn, D-33095 Paderborn, Germany
Abstract:We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM). In a PRAM, memory conflicts occur only through concurrent access to the same cell, whereas the memory of a DMM is divided into modules, one for each processor, and concurrent accesses to the same module create a conflict. Thedelay of a simulation is the time needed to simulate a parallel memory access of the PRAM. Any general simulation of anm processor PRAM on ann processor DMM will necessarily have delay at leastm/n. A randomized simulation is calledtime-processor optimal if the delay isO(m/n) with high probability. Using a novel simulation scheme based on hashing we obtain a time-processor optimal simulation with delayO(log log(n) log*(n)). The best previous simulations use a simpler scheme based on hashing and have much larger delay: THgr (log(n)/log log(n)) for the simulation of an n processor PRAM on ann processor DMM, and THgr(log(n)) in the case where the simulation is time-processor optimal.Our simulations use several (two or three) hash functions to distribute the shared memory among the memory modules of the PRAM. The stochastic processes modeling the behavior of our algorithms and their analyses based on powerful classes of universal hash functions may be of independent interest.Research partially supported by NSF/DARPA Grant CCR-9005448. Work was done while at the University of California at Berkeley and the International Computer Science Institute, Berkeley, CA.Research partially supported by National Science Foundation Operating Grant CCR-9016468, National Science Foundation Operating Grant CCR-9304722, United States-Israel Binational Science Foundation Grant No. 89-00312, United States-Israel Binational Science Foundation Grant No. 92-00226, and ESPRIT BR Grant EC-US 030.Part of work was done during a visit at the International Computer Science Institute at Berkeley; supported in part by DFG-Forschergruppe ldquoEffiziente Nutzung massiv paralleler Systeme, Teilprojekt 4,rdquo and by the Esprit Basic Research Action Nr. 7141 (ALCOM II).
Keywords:PRAM  Simulation  Distributed memory machine  Universal hashing  Stochastic modeling  Balls and bins
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号