Contention resolution in hashing based shared memory simulations

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1703-1739

  Czumaj, Artur ^a   Meyer Auf Der Heide, Friedhelm ^a   Stemann, Volker ^a,b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Deutsche Morgan Grenfell   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY;

DISTRIBUTED MEMORY MACHINES (DMM); SHARED MEMORY SIMULATION;

DATA STORAGE EQUIPMENT;

EID: 0034543310     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979529564X     Document Type: Article

References (33)

1. R. J. ANDERSON AND G. L. MILLER, Optical Communication for Pointer Based Algorithms, Tech. Report CRI 88-14, University of Southern California, Los Angeles, CA, 1988.
2. H. BAST AND T. HAGERUP, Fast and reliable parallel hashing, in Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, NY, 1991, pp. 50-61.
3. H. BAST AND T. HAGERUP, Fast parallel space allocation, estimation and integer sorting, Inform, and Comput., 123 (1995), pp. 72-110.
4. O. BERKMAN AND U. VISHKIN, Recursive star-tree parallel data structure, SIAM J. Comput., 22 (1993), pp. 221-242.
5. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
6. M. DIETZFELBINGER, A. KARLIN, K. MEHLHORN, F. MEYER AUF DER HEIDE, H. ROHNERT, AND R. E. TARJAN, Dynamic perfect hashing: Upper and lower bounds, SIAM J. Comput., 23 (1994), pp. 738-761.
7. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, How to distribute a dictionary in a complete network, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, 1990, pp. 117-127.
8. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, Simple, efficient shared memory simulations, in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, NY, 1993, pp. 110-119.
9. P. ERDOS AND A. RÉNYI, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kut. Int. Közl., 5 (1960), pp. 17-61.
10. J. GIL, Y. MATIAS, AND U. VISHKIN, Towards a theory of nearly constant time parallel algorithms, in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, IEEE Press, Los Alamitos, CA, 1991, pp. 698-710.
11. L. A. GOLDBERG, M. JERRUM, T. LEIGHTON, AND S. RAO, Doubly logarithmic communication algorithms for optical communication parallel computers, SIAM J. Comput., 26 (1997), pp. 1100-1119.
12. L. A. GOLDBERG, Y. MATIAS, AND S. RAO, An optical simulation of shared memory, in Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, NY, 1994, pp. 257-267.
13. M. T. GOODRICH, Y. MATIAS, AND U. VISHKIN, Optimal parallel approximation algorithms for prefix sums and integer sorting, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York, NY, 1994, pp. 241-250.
14. T. HAGERUP, The log-star revolution, in Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 577, Springer-Verlag, Heidelberg, 1992, pp. 259-278.
15. T. HAGERUP AND C. RÜB, A guided tour of Chernoff bounds. Inform. Process. Lett., 33 (1989/90), pp. 305-308.
16. J. JÁJÁ, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.
17. A. KARLIN AND E. UPFAL, Parallel hashing - an efficient implementation of shared memory, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, 1986, pp. 160-168.
18. R. KARP AND V. RAMACHANDRAN, A survey of parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier Science, Amsterdam, The Netherlands, 1990, pp. 869-941.
19. R. M. KARP, M. LUBY, AND F. MEYER AUF DER HEIDE, Efficient PRAM simulation on a distributed memory machine, Algorithmica, 16 (1996), pp. 517-542.
20. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, San Mateo, CA, 1992.
21. T. LEIGHTON, Methods for message routing in parallel machine, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, 1992, pp. 77-96.
22. P. D. MACKENZIE, C. G. PLAXTON, AND R. RAJARAMAN, On contention resolution protocols and associated probabilistic phenomena, J. ACM, 45 (1998), pp. 324-378.
23. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics, J. Siemons, ed., London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
24. K. MEHLHORN AND U. VISHKIN, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Inform., 21 (1984), pp. 339-374.
25. F. MEYER AUF DER HEIDE, C SCHEIDELER, AND V. STEMANN, Exploiting storage redundancy to speed up randomized shared memory simulations, Theoret. Comput. Sci., 162 (1996), pp. 245-281.
26. P. RAGDE, The parallel simplicity of compaction and chaining, J. Algorithms, 14 (1993), pp. 371-380.
27. A. G. RANADE, How to emulate shared memory, J. Comput. System Sci., 42 (1991), pp. 307-326.
28. J. H. REIF, ed., Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1993.
29. A. SIEGEL, On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, IEEE Press, Los Alamitos, CA, 1989, pp. 20-25.
30. V. STEMANN, Contention Resolution in Hashing Based Shared Memory Simulations, Ph.D. thesis, Fachbereich 17, University of Paderborn, Paderborn, Germany, 1995.
31. E. UPFAL, Efficient schemes for parallel communication, J. ACM, 31 (1984), pp. 507-517.
32. E. UPFAL AND A. WIGDERSON, How to share memory in a distributed system, J. ACM, 34 (1987), pp. 116-127.
33. L. G. VALIANT, General purpose parallel architectures, in Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier Science, Amsterdam, The Netherlands, 1990, pp. 943-971.