Download:
|
by A. Czumaj, F. Meyer, Heide V. Stemann
In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems
http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/documents/../../PapersPostscript/ImprOptShaMem_ISTCS95.ps.gz
Add To MetaCart
Abstract:
We present time-processor optimal randomized algorithms for simulating a shared memory machine (EREW PRAM) on a distributed memory machine (DMM). The first algorithm simulates each step of an n-processor EREW PRAM on an n-processor DMM with O( log log n log log log n) delay with high probability. This simulation is work optimal and can be made timeprocessor optimal. The best previous optimal simulations require O(log log n) delay. We also study reconfigurable DMMs which are a "complete network version " of the well studied reconfigurable meshes. We show an algorithm that simulates each step of an n-
Citations
|
1230
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1991
|
|
572
|
An Introduction to Parallel Algorithms
– JàJà
- 1992
|
|
237
|
On the method of bounded differences
– McDiarmid
- 1989
|
|
83
|
auf der Heide. Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
51
|
Parallel Hashing: An Efficient Implementation of Shared Memory
– Karlin, Upfal
- 1988
|
|
48
|
Recursive star-tree parallel data structure
– Berkman, Vishkin
- 1993
|
|
48
|
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer
– Goldberg, Jerrum, et al.
- 1993
|
|
45
|
Converting high probability into nearly-constant time|with applications to parallel hashing
– Matias, Vishkin
- 1991
|
|
42
|
An optical simulation of shared memory
– Goldberg, Matias, et al.
- 1994
|
|
39
|
auf der Heide. Simple, efficient shared memory simulations
– Dietzfelbinger, Meyer
- 1993
|
|
35
|
auf der Heide. A new universal class of hash functions and dynamic hashing in real time
– Dietzfelbinger, Meyer
- 1990
|
|
34
|
On Contention Resolution Protocols and Associated Probabilistic Phenomena
– MacKenzie, Plaxton, et al.
- 1994
|
|
33
|
Fast parallel space allocation, estimation and integer sorting
– Bast, Hagerup
- 1995
|
|
17
|
The complexity of reconfiguring network models
– BEN-ASHER, LANGE, et al.
- 1995
|
|
4
|
Methods for packet routing in parallel machines
– Leighton
- 1992
|
|
1
|
Ranking in reconfigurable networks
– Ben-Asher, Schuster
- 1991
|
|
1
|
An optical simulation of shared memory
– Mat, ias, et al.
- 1994
|
|
1
|
Parallel hashing - an efficient imp1ement)ation of shared memory
– Karlin, Upfal
- 1986
|
|
1
|
auf der Heide. EEcient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1993
|
