How to share memory in a distributed system

From MaRDI portal
Publication:3766836

DOI10.1145/7531.7926zbMath0629.68028OpenAlexW2066015450MaRDI QIDQ3766836

Eli Upfal, Avi Wigderson

Publication date: 1987

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/7531.7926




Related Items (27)

Locality-preserving hash functions for general purpose parallel computationLong-lived RAMBO: trading knowledge for communicationExploiting storage redundancy to speed up randomized shared memory simulationsA probabilistic simulation of PRAMs on a bounded degree networkSimulating shared memory in real time: On the computation power of reconfigurable architecturesShared memory simulations with triple-logarithmic delayImplementing shared memory on multi-dimensional meshes and on the fat-treeReconfigurable distributed storage for dynamic networksExpander graphs and their applicationsRepresenting shared data on distributed-memory parallel computers\textsc{Ramos}: concurrent writing and reconfiguration for collaborative systemsA new scheme for the deterministic simulation of PRAMs in VLSIGeoQuorums: implementing atomic memory in mobile ad hoc networksA complexity theory of efficient parallel algorithmsA GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networksPractical constructive schemes for deterministic shared-memory accessImproved deterministic PRAM simulation on the meshThe complexity of deterministic PRAM simulation on distributed memory machinesThresholds for extreme orientabilityClocked adversaries for hashingTowards a scalable and robust DHTDistributed MST for constant diameter graphsDeterministic P-RAM simulation with constant redundancyDETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINESImplementing shared memory on mesh-connected computers and on the fat-treeShallow grates







This page was built for publication: How to share memory in a distributed system