On contention resolution protocols and associated probabilistic phenomena

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 153-162

  Mackenzie, P D ^a   Plaxton, C G ^a   Rajaraman, R ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; COMPUTATIONAL METHODS; COMPUTER NETWORKS; DATA COMMUNICATION EQUIPMENT; ONLINE SYSTEMS; PROBABILISTIC LOGICS; RANDOM ACCESS STORAGE; RANDOM PROCESSES; STORAGE ALLOCATION (COMPUTER);

ABSTRACT PROCESS; CONTENTION RESOLUTION PROTOCOLS; DETERMINISTIC ALGORITHMS; ONLINE SCHEDULING; RANDOMIZED STRATEGY; SCHEDULING PROBLEM; SHARED MEMORY;

COMPUTATION THEORY; NETWORK PROTOCOLS;

ASSOCIATED PROBABILISTIC PHENOMENA; C COLLISION CROSSBAR NETWORKS; CONTENTION RESOLUTION PROTOCOLS;

EID: 0028076573     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195122     Document Type: Conference Paper

References (21)

1. N. Abramson. The ALOHA system. In N. Abramson and F. Kuo, editors, Computer-Communication Networks. Prentice-Hall, Englewood Cliffs, NJ, 1973.
2. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. JCSS, 43:290-298, 1991.
3. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley- Interscience, New York, NY, 1992.
4. R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI-88-14, Computer Science Department, University of Southern California, 1988.
5. H. Chernoff. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
6. 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, pages 110-119, June 1993.
7. M. Gereb-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 41-48, June 1992.
8. L. A. Goldberg and M. Jerrum. A sub-logarithmic communication algorithm for the completely connected optical communication parallel computer. Technical Report ECS-LFCS- 92-234, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, September 1992.
9. L. A. Goldberg, M. Jerrum, F. T. Leighton, and S. B. Rao. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 300-309, June 1993.
10. L. A. Goldberg, Y. Matias, and S. B. Rao. An optical simulation of shared memory. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1994. To appear.
11. A. G. Greenberg, P. Flajolet, and R. E. Laclner. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. Journal of the ACM, 34:289-325, 1987.
12. A. G. Greenberg and S. Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM, 32:589-596, 1985.
13. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 318-326, May 1992.
14. J. Komlos and A. G. Greenberg. An asymptotically non-Adaptive algorithm for conflict resolution in multiple-Access channels. IEEE Transactions on Information Theory, IT- 31:302-306, 1985.
15. P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. Technical Report TR-94-06, University of Texas at Austin, Department of Computer Science, April 1994.
16. C. U. Martel and T. P. Vayda. The complexity of selection resolution, conflict resolution, and maximum finding on multiple access channels. In Proceedings of the 3rd International Workshop on Parallel Computation and VLSI Theory, pages 401-410, 1988.
17. R. Metcalfe and D. Boggs. Ethernet: Distributed packet switching for local computer networks. Communications of the ACM, 19:395-404, 1976.
18. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Fast, simple dictionaries and shared memory simulations on distributed memory machines; upper and lower bounds. Manuscript, January 1994.
19. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34:116-127, 1987.
20. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 943- 971. Elsevier/MIT Press, 1990.
21. A. C. Yao. Lower bounds by probabilistic arguments. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, pages 420-428, October 1983.