A parallel-design distributed-implementation (PDDI) general-purpose computer
Theoretical Computer Science
Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorica
Deterministic simulation of idealized parallel computers on more realistic ones
SIAM Journal on Computing
A probabilistic simulation of PRAMs on a bounded degree network
Information Processing Letters
Efficient parallel algorithms
Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
SIAM Journal on Computing
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Communication complexity of PRAMs
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
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 bridging model for parallel computation
Communications of the ACM
Proceedings of the fifth MIT conference on Advanced research in VLSI
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
How to distribute a dictionary in a complete network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The computational complexity of universal hashing
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
Analysis of parallel uniform hashing
Information Processing Letters
Deterministic P-RAM simulation with constant redundancy
Information and Computation
Improved memory utilization in deterministic PRAM simulation
Journal of Parallel and Distributed Computing - Special issue on shared-memory multiprocessors
Journal of Computer and System Sciences
Oblivious routing with limited buffer capacity
Journal of Computer and System Sciences
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Classifikation of Problems which have Fast Parallel Algorithms
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A probabilistic relation between desirable and feasible, models of parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Improved Sorting Networks with O(log n) Depth
Improved Sorting Networks with O(log n) Depth
CMAPS: a cosynthesis methodology for application-oriented parallel systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
The Power of SIMDs in Real-Time Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Deterministic computations on a PRAM with static processor and memory faults
Fundamenta Informaticae
Adaptive scheduling with parallelism feedback
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Algorithms and theory of computation handbook
Deterministic Computations on a PRAM with Static Processor and Memory Faults
Fundamenta Informaticae
Fundamenta Informaticae
Hi-index | 0.00 |
The Parallel Random Access Machine (PRAM) is an abstract model of parallel computation which allows researchers to focus on the essential characteristics of a parallel architecture and ignore other details. The PRAM has long been acknowledged to be a useful tool for the study of parallel computing, but unfortunately it is not physically implementable in hardware. In order to take advantage of the broad base of algorithms and results regarding this high-level abstraction one needs general methods for allowing the execution of PRAM algorithms on more realistic machines. In the following we survey these methods, which we refer to as PRAM simulation techniques. The general issues of memory management and routing are discussed, and both randomized and deterministic solutions are considered. We show that good theoretical solutions to many of the subproblems in PRAM simulation have been developed, though questions still exist as to their practical utility. This article should allow those performing research in this field to become well acquainted with the current state of the art, while allowing the novice to get an intuitive feeling for the fundamental questions being considered. The introduction should provide a concise tutorial for those unfamiliar with the problem of PRAM simulation.