Richard M. Karp, Michael Luby, F. Meyer auf der Heide  Home/Search
Context Related
| berkeley.edu/~luby/PAPERS/modules.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~luby/parallel (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Perfectly Balanced Allocation - Czumaj, Riley, Scheideler (2003) (Correct)
A Frame for the Simulation of Shared Memory on.. - Kontogiannis.. (1997) (Correct)
Balls-and-Bins Communication Scheduling for Wireless.. - Molnar, Shankar, Tong (Correct)
Similar documents (at the sentence level):
76.0%: Efficient PRAM Simulation on a Distributed Memory Machine - Karp, Luby, der Heide (1992) (Correct)
Active bibliography (related documents): More All
0.7: General Purpose Parallel Computing - McColl (1993) (Correct)
0.4: Exploiting Storage Redundancy to Speed Up Randomized.. - der Heide.. (1996) (Correct)
0.3: On Parallel Hashing and Integer Sorting - Matias, Vishkin (1991) (Correct)
Similar documents based on text: More All
0.3: Simulating Shared Memory in Real Time: On the.. - Czumaj, der Heide.. (1995) (Correct)
0.3: Shared Memory Simulations with Triple-Logarithmic Delay.. - Czumaj, al. (1995) (Correct)
0.3: Improved Optimal Shared Memory Simulations, and the.. - Czumaj, der Heide.. (Correct)
Related documents from co-citation: More All
31: Balanced Allocations - Azar, Broder et al. - 1994
23: How to emulate shared memory (context) - Ranade - 1991
21: efficient shared memory simulations (context) - Dietzfelbinger, auf et al. - 1993
BibTeX entry: (Update)
R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. In Proceedings of the Twenty-Fourth Annual ACM Symposium of the Theory of Computing, May 1992. http://citeseer.ist.psu.edu/karp94efficient.html More
@inproceedings{ karp92efficient,
author = "Richard M. Karp and Michael Luby and Friedhelm Meyer auf der Heide",
title = "Efficient {PRAM} simulation on a distributed memory machine",
pages = "318--326",
year = "1992",
url = "citeseer.ist.psu.edu/karp94efficient.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1991
411 Random Graphs (context) - Bollob'as - 1985
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
234 General purpose parallel architectures (context) - Valiant - 1990
196 How to emulate shared memory (context) - Ranade - 1987
123 the method of bounded differences (context) - McDiarmid - 1989
112 Randomized and deterministic simulations of PRAMs by paralle.. (context) - Mehlhorn, Vishkin - 1984
70 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
57 Efficient schemes for parallel communication (context) - Upfal - 1984
56 Relations between concurrent-write models of parallel comput.. (context) - Fich, Ragde et al. - 1988
56 Towards a theory of nearly constant time parallel algorithms (context) - Gil, Matias et al. - 1991
55 Parallel hashing --- an efficient implementation of shared m.. (context) - Karlin, Upfal - 1986
47 Converting high probability into nearly-constant time -- wit.. - Matias, Vishkin - 1991
44 On universal classes of fast high performance hash functions (context) - Siegel - 1989
29 A new universal class of hash functions and dynamic hashing .. (context) - Dietzfelbinger, auf - 1990
18 Fast hashing on a PRAM-designing by expectation (context) - Gil, Matias - 1991
16 New simulations between CRCW PRAMs (context) - Chlebus, Diks et al. - 1989
15 Fast and reliable parallel hashing (context) - Bast, Hagerup - 1991
11 Simulations among concurrent-write PRAMs (context) - Fich, Ragde et al. - 1988
5 Efficient simulations between concurrent-read concurrent-wri.. (context) - Chlebus, Diks et al. - 1988
3 How to distribute a hash table in a complete network (context) - Dietzfelbinger, auf - 1990
2 Leaders election without a conflict resolution rule -- fast .. (context) - Gil, Matias
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.icsi.berkeley.edu/~luby/parallel.html):
A Parallel Approximation Algorithm for Positive Linear.. - Michael Luby Noam (1993) (Correct)
Network Decomposition and Locality in Distributed Computation.. - Awerbuch, al. (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC