Fault-tolerant shared memory simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 181-192

  Berenbrink, Petra ^a   Meyer auf der Heide, Friedhelm ^a   Stemann, Volker ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY;

CONSTANT FACTORS; DISTRIBUTED MEMORY MACHINES; FAILURE PROBABILITY; FAULT-TOLERANT; HIGH PROBABILITY; MEMORY MODULES; ON DYNAMICS; SHARED MEMORY;

MEMORY ARCHITECTURE;

EID: 84948158785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_16     Document Type: Conference Paper

References (17)

1. J.R. Anderson and G.L. Miller: Optical communication for pointer based algorithms. Technical Report CRI88-14, Computer Science Department, University of Southern Carolina, Los Angeles, CA 90089-0782 USA, 1988.
2. Ö. Babaoglu, R. Drummond and R Stephenson: The impact of communication network properties on reliable broadcast protocols. Technical Report, Department of Computer Science, Cornell University, Ithaca, New York 1988.
3. R Berenbrink, F. Meyer auf der Heide and V. Stemann: Fault-tolerant shared memory simulations. Technical Report, to appear.
4. B.S. Chlebus, A. Gambin and P. Indyk: PRAM computations resilient to memory faults. In Proc. of the 2nd Annual European Symposium on Algorithms, pp 401-412, 1994.
5. F. Christian, H. Aghili, D. Dolev and Ray Strong: Atomic broadcast: from simple message diffusion to byzantine agreement. Computer Science, 1984.
6. A. Czumaj, F. Meyer auf der Heide and V. Stemann: Shared memory simulations with triple logarithmic delay. In Proc. of the 3rd Annual European Symposium on Algorithms, pp 46-59, 1995.
7. M. Dietzfelbinger and F. Meyer auf der Heide: Simple, efficient shared memory simulations. In Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 110-119, 1993.
8. M. Dietzfelbinger and F. Meyer auf der Heide: How to distribute a hash table in a complete network. In Proc. of the 22nd ACM Symposium on Theory of Computing, pp 117-127, 1990.
9. L.A. Goldberg, M. Jerrum and T. Leighton: A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 300-309, 1993.
10. L.A. Goldberg, Y. Matias and S. Rao: An optical simulation of shared memory. In Proc. of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 257-267, 1994.
11. R. Karp, M. Luby, and F. Meyer auf der Heide: Efficient PRAM simulations on distributed memory machine. In Proc. of the 24th Annual ACM Symposium on Theory of Computing, pp 318-326, 1992.
12. P.D. MacKenzie, C.G. Plaxton, R. Rajamaran: On contention resolution protocols and associated phenomena. University of Texas at Austin, Technical Report 94-06, 1994.
13. F. Meyer auf der Heide: Hashing strategies for simulating shared memory on distributed memory machines. In Proc. of the 1 st Heinz Nixdorf Symposium "Parallel Architectures and their Efficient Use," F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., pp 20-29, 1992.
14. F. Meyer auf der Heide, C. Scheideler and V. Stemann: Exploiting storage redundancy to speed up randomized shared memory simulations. In Proc. of the 12th Annual Symposium on Theoretical Aspects of Computer Science, pp 267-278, 1995.
15. J.P. Schmitt, A. Siegel and A. Srinivasan: Chernoff-Hoeffding bounds for applications with limited independence. In the Proc. of the 4th ACM-Siam Symposium on Discrete Algorithms, pp 331-340, 1993.
16. A. Siegel: On universal classes of fast high performance hash functions, their time-space tradeoff and their applications. In Proc. of the 30th IEEE Annual Symposium on Foundations of Computer Science, pp 20-25, 1989.
17. E. Upfal and A. Wigderson: How to share memory in a distributed system. J. Assoc. Comput. Mach. 34, pp 116-127, 1987.