Skip to main content
Springer Nature Link
Log in

Better computing on the anonymous ring

Extended Abstract

  • 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:

  • 186 Accesses

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.

References

  1. D. Angluin, “Local and Global Properties in Networks of Processors,” 12th Ann. ACM Symp. on Theory of Computing, (1980) 82–93.

    Google Scholar 

  2. H. Attiya and M. Snir “Better Computing on the Anonymous Ring,” Research Report, IBM T. J. Watson Res. Center, April 1988.

    Google Scholar 

  3. H. Attiya, M. Snir and M. Warmuth, “Computing on the Anonymous Ring,” J. of the ACM, to appear.

    Google Scholar 

  4. H. Bodleander, “Distributed Algorithms: Structure and Complexity,” Ph.D. Thesis, University of Utrecht, 1986.

    Google Scholar 

  5. H. Chernoff, “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,” Annals of Math. Stat., 23 (1983) 223–234.

    Google Scholar 

  6. E. Chang and R. Roberts, “An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations,” Comm. of the ACM, 22 (1979) 281–283.

    Article  MATH  Google Scholar 

  7. P. Duris and Z. Galil, “Two Lower Bounds in Asynchronous Distributed Computation,” proceedings, 28th Ann. IEEE Symp. on Foundations of Computer Science, (1987) 326–330.

    Google Scholar 

  8. W. Feller, An Introduction to Probability Theory and its Applications, Third Edition, Vol. 1. John Wiley & Sons Inc., New York, 1968.

    Google Scholar 

  9. J. Pachl, “A Lower Bound for Probabilistic Distributed Algorithm,” J. of Algorithms, 8 (1987) 53–65.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Pachl, E. Korach and D. Rotem, “A New Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms,” J. ACM, 31 (1984) 905–918.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Rabin, “N-Process Synchronization by 4 Log2 N-Valued Shared Variable,” J. of Computer and System Sciences, 25 (1982) 66–75.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Raghavan, “Randomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and packing Problems,” Report UCB/CSD 87/312, Comp. Sc. Div., Univ. of California Berkeley, July 1986.

    Google Scholar 

  13. V. Syrotiuk and J. Pachl, “Average Complexity of a Distributed Orientation Algorithm,” Research Report CS-87-23, Univ. of Waterloo, March 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Hagit Attiya

  2. IBM T. J. Watson Research Center, 10598, Yorktown Heights, NY, USA

    Marc Snir

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Snir
    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

Attiya, H., Snir, M. (1988). Better computing on the anonymous ring. 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/BFb0040400

Download citation

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

  • 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