Exploiting storage redundancy to speed up randomized shared memory simulations
- 1 August 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 162 (2) , 245-281
- https://doi.org/10.1016/0304-3975(96)00032-1
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Shared memory simulations with triple-logarithmic delayPublished by Springer Nature ,1995
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- An optical simulation of shared memoryPublished by Association for Computing Machinery (ACM) ,1994
- On contention resolution protocols and associated probabilistic phenomenaPublished by Association for Computing Machinery (ACM) ,1994
- Simple, efficient shared memory simulationsPublished by Association for Computing Machinery (ACM) ,1993
- A doubly logarithmic communication algorithm for the completely connected optical communication parallel computerPublished by Association for Computing Machinery (ACM) ,1993
- Efficient optical communication in parallel computersPublished by Association for Computing Machinery (ACM) ,1992
- Fast and reliable parallel hashingPublished by Association for Computing Machinery (ACM) ,1991
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979