Efficient PRAM Simulation on a Distributed Memory Machine

Efficient PRAM Simulation on a Distributed Memory Machine (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Richard M. Karp , Michael Luby , Friedhelm Meyer auf der Heide

Venue:	IN PROCEEDINGS OF THE TWENTY-FOURTH ACM SYMPOSIUM ON THEORY OF COMPUTING
Citations:	13 - 0 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Efficient PRAM Simulation on a Distributed Memory Machine	user correction - Legacy Corrections
AUTHOR NAME	Richard M. Karp	user correction
AUTHOR AFFIL	University of California at Berkeley and; International Computer Science Institute, Berkeley	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Michael Luby	user correction
AUTHOR AFFIL	International Computer Science Institute, Berkeley, CA; and UC Berkeley	user correction
AUTHOR NAME	Friedhelm Meyer auf der Heide	user correction
AUTHOR AFFIL	Heinz Nixdorf Institute and Computer Science Department,; University of Paderborn	user correction
AUTHOR ADDR	Germany	user correction
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. The delay of a simulation is the time needed to simulate a parallel memory access of the PRAM. Any general simulation of an m processor PRAM on a n processor DMM will necessarily have delay at least m=n. A randomized simulation is called time-processor optimal if the delay is O(m=n) with high probability. Using a novel simulation scheme based on hashing we obtain a time-processor optimal simulation with delay O(loglog(n)log (n)). The best previous simulations use a simpler scheme based on hashing and have much larger delay: \Theta(log(n)= loglog(n)) for the simulation of an n processor PRAM on an n processor DMM, and \Theta(log(n)) in the case ...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	IN PROCEEDINGS OF THE TWENTY-FOURTH ACM SYMPOSIUM ON THEORY OF COMPUTING	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	318--326	INFERENCE
VOLUME	16	INFERENCE
TECH	Technical Report TR-RI-93134	INFERENCE
CITATIONS	16 found	ParsCit 1.0