Skip to main content
SpringerLink
Log in

The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels

  • Distributed Computing
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 319))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. Abrahamson, K., Personal Communication, Department of Computer Science, Washington State University, September, 1987.

    Google Scholar 

  2. Capetanakis, J. I., Tree Algorithms for Packet Broadcast Channels, IEEE Transactions on Information Theory, Vol. OT-25, No. 5, (September 1979) pp. 505–515.

    Article  MathSciNet  Google Scholar 

  3. Dechter, R. and Kleinrock, L., Broadcast Communications and Distributed Algorithms. IEEE Transactions on Computers, Vol. C-35, No. 3, (March 1986) pp. 210–219.

    Google Scholar 

  4. Fich, F.E., Ragde, P.L., and Wigderson, A., Relations Between Concurrent-Write Models of Parallel Computation, To appear in SIAM Journal on Computing.

    Google Scholar 

  5. Greenberg, A., On the Time Complexity of Broadcast Communication Schemes. Proceedings of the 14th Symposium on the Theory of Computing, (1984) pp. 354–364.

    Google Scholar 

  6. Greenberg, A. G., Efficient Algorithms for Multiple Access Channels, T.R. No. #83-08-01 Department of Computer Science, University of Washington, Seattle, August 1983.

    Google Scholar 

  7. Greenberg, A. G., Flajolet, P. and Ladner, R. E., Estimating the Multiplicities of Conflicts to Speed Their Resolution in Multiple Access Channels, Journal of the Association for Computing Machinery, Vol. 34, No. 2, (April 1987) pp. 289–325.

    MATH  MathSciNet  Google Scholar 

  8. Greenberg, A. G., Lubachevsky, B. D. and Odlyzko, A. M., Simple, Efficient Asynchronous Parallel Algorithms for Maximization. Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, (August 1985) pp. 300–308.

    Google Scholar 

  9. Greenberg, A. and Winograd, S., A lower bound on time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM, Vol. 32, No. 3, (July 1985) pp. 589–596.

    Article  MATH  MathSciNet  Google Scholar 

  10. Hayes, J. F., An Adaptive Technique for Local Distribution. IEEE Transactions on Communications, Vol. COM-26, No. 8, (August 1978) pp. 1178–1186.

    Article  Google Scholar 

  11. IEEE Project 802, Draft IEEE Standard 802.3 CSMA/CD Access Method and Physical Layer Specifications. IEEE Computer Society, Revision D, December 1982

    Google Scholar 

  12. Komlos, J. and Greenberg, A. G. An Asymptotically Fast Non-adaptive Algorithm for Conflict Resolution in Multiple Access Channels, IEEE Trans. Inf. Theory (March 1985)

    Google Scholar 

  13. Levitan, S., Algorithms for Broadcast Protocol Multiprocessors. Proceedings of the 3rd International Conference on Distributed Computer Systems, (1982) pp. 666–671.

    Google Scholar 

  14. Levitan, S. P. and Foster, C., Finding an Extremum in a Network. Proceedings Ninth International Symposium of Computer Architecture, (April 1982) pp. 321–325.

    Google Scholar 

  15. Martel, C., Gusfield, D. A Fast Parallel Quicksort Algorithm, Preprint, U.C. Davis, 1988

    Google Scholar 

  16. Martel, C. and Vayda, T. Load Estimation, Problem Size Reduction and Maximum Finding in Multiple Access Broadcast Networks. Proc. of 25th Annual Allerton Conf., Oct. 1987.

    Google Scholar 

  17. Metcalfe, R. and Boggs, D., Ethernet: Distributed Packet Switching for Local Computer Networks. Communications of the ACM, Vol. 19, No. 7, (July 1976) pp. 395–404.

    Article  Google Scholar 

  18. Ragde, P. Lower Bounds for Parallel Computation, Ph.D. Thesis, U.C. Berkeley 1986.

    Google Scholar 

  19. Vayda, T. P., On the Complexity of Parallel Algorithms for Multiple Access Networks, Ph.D. Thesis, Division of Computer Science, U.C. Davis, Davis Ca. 1988.

    Google Scholar 

  20. Wah, B. and Juang, J., Resource Scheduling for Local Computer Systems with a Multiaccess Network. IEEE Transactions on Computers, Vol. C-34, No. 12, (December 1985)

    Google Scholar 

  21. Willard, D. E., Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM Journal of Computing, Vol. 15, No. 2, (May 1986) pp. 468–477.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, University of California at Davis, 95616, Davis, California

    Charles U. Martel

  2. Department of Computer Science, California State University at Chico, 95929, Chico, California

    Thomas P. Vayda

Authors
  1. Charles U. Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas P. Vayda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martel, C.U., Vayda, T.P. (1988). The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040407

Download citation

  • DOI: https://doi.org/10.1007/BFb0040407

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation