A parallel-design distributed-implementation (PDDI) general-purpose computer
Theoretical Computer Science
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A Survey of Parallel Machine Organization and Programming
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of 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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Virtual memory for a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Space-efficient representations of shared data for parallel computers
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Compact deterministic distributed dictionaries (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
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
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
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Proceedings of the eighth 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
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Parallel hashing: an efficient implementation of shared memory
Journal of the ACM (JACM)
One-to-Many routing on the mesh
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Implementing Shared Memory on Clustered Machines
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Long-lived Rambo: Trading knowledge for communication
Theoretical Computer Science
Reconfigurable distributed storage for dynamic networks
Journal of Parallel and Distributed Computing
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Memory organization schemes for large shared data
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
ACM SIGACT News
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
The power of shared-memory in models of parallel computation is studied, and a novel distributed data structure that eliminates the need for shared memory without significantly increasing the run time of the parallel computation is described. More specifically, it is shown how a complete network of processors can deterministically simulate one PRAM step in O(log n/(log log n)2) time when both models use n processors and the size of the PRAM's shared memory is polynomial in n. (The best previously known upper bound was the trivial O(n)). It is established that this upper bound is nearly optimal, and it is proved that an on-line simulation of T PRAM steps by a complete network of processors requires &OHgr;(T(log n/ log log n)) time.A simple consequence of the upper bound is that an Ultracomputer (the currently feasible general-purpose parallel machine) can simulate one step of a PRAM (the most convenient parallel model to program) in O((log n)2log log n) steps.