Efficient PRAM simulation on a distributed memory machine

Authors:
Richard M. Karp;Michael Luby;Friedhelm Meyer auf der Heide
Affiliations:
University of California at Berkeley and International Computer Science Institute, Berkeley, CA;International Computer Science Institute, Berkeley, CA;University of Paderborn, Germany
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 9
Cited 53

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

Acta Informatica
Parallel hashing—an efficient implementation of shared memory

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A complexity theory of efficient parallel algorithms

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A new universal class of hash functions and dynamic hashing in real time

Proceedings of the seventeenth international colloquium on Automata, languages and programming
How to distribute a dictionary in a complete network

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast and reliable parallel hashing

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)

LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallel algorithms column 1: models of computation

ACM SIGACT News
A practical constructive scheme for deterministic shared-memory access

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Simple, efficient shared memory simulations

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal broadcast and summation in the LogP model

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
A survey of PRAM simulation techniques

ACM Computing Surveys (CSUR)
Constructive deterministic PRAM simulation on a mesh-connected computer

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On contention resolution protocols and associated probabilistic phenomena

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Balanced allocations (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallel randomized load balancing

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Parallel balanced allocations

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
LogP: a practical model of parallel computation

Communications of the ACM
Fast Parallel Sorting Under LogP: Experience with the CM-5

IEEE Transactions on Parallel and Distributed Systems
On the analysis of randomized load balancing schemes

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
How useful is old information (extended abstract)?

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On contention resolution protocols and associated probabilistic phenomena

Journal of the ACM (JACM)
Simple competitive request scheduling strategies

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Communication-processor tradeoffs in limited resources PRAM

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Randomized and adversarial load balancing

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
How Useful Is Old Information?

IEEE Transactions on Parallel and Distributed Systems
Fast concurrent access to parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Asynchronous scheduling of redundant disk arrays

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Efficient, distributed data placement strategies for storage area networks (extended abstract)

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Interpreting Stale Load Information

IEEE Transactions on Parallel and Distributed Systems
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Theoretical Computer Science
The Power of Two Choices in Randomized Load Balancing

IEEE Transactions on Parallel and Distributed Systems
Work-optimal simulation of PRAM models on meshes

Nordic Journal of Computing
Simplified Witness Tree Arguments

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Design and Analysis of Dynamic Processes: A Stocastic Approach

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Analyzing an Infinite Parallel Job Allocation Process

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
How asymmetry helps load balancing

Journal of the ACM (JACM)
How Asymmetry Helps Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A work-optimal deterministic algorithm for the asynchronous certified write-all problem

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous Scheduling of Redundant Disk Arrays

IEEE Transactions on Computers
Studying Balanced Allocations with Differential Equations

Combinatorics, Probability and Computing
On zone-balancing of peer-to-peer networks: analysis of random node join

Proceedings of the joint international conference on Measurement and modeling of computer systems
Adversarial contention resolution for simple channels

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Balanced allocations with heterogenous bins

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Load-balancing performance of consistent hashing: asymptotic analysis of random node join

IEEE/ACM Transactions on Networking (TON)
Linked decompositions of networks and the power of choice in Polya urns

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Memory organization schemes for large shared data

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Load balancing and orientability thresholds for random hypergraphs

Proceedings of the forty-second ACM symposium on Theory of computing
Balls into bins with related random choices

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The (1 + β)-choice process and weighted balls-into-bins

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Stabilizing consensus with the power of two choices

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Balls into bins with related random choices

Journal of Parallel and Distributed Computing
On weighted balls-into-bins games

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a randomized simulation of a nlog log (n) log (n)-processor shared memory machine (DMM) with optimal expected delay O(log log (n)) per step of simulation. The time bound for the delay is guaranteed with overwhelming probability. The algorithm is based on hashing and uses a novel simulation scheme. The best previous simulations use a simpler scheme based on hashing and have much larger expected delay: &THgr;(log(n)/log log (n)) for the simulation of an n-processor PRAM on an n processor DMM, and &THgr;(log(n)) in the case where the simulation preserves the processor-time product.