Skip to main content
Springer Nature Link
Log in

New upperbounds for decentralized extrema-finding in a ring of processors

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 86 (STACS 1986)

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

Included in the following conference series:

  • 124 Accesses

Abstract

We show that decentralized extrema-finding ("election") is more efficient in bidirectional rings than in unidirectional rings of processors, by exhibiting a (non-probabilistic) algorithm for distributed extrema-finding in bidirectional rings that requires fewer messages on the average than any such algorithm for unidirectional rings.

The work of this author was supported by the Foundation for Computer Science (SION) of the Netherlands Organisation for the Advancement of Pure Research (ZWO).

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.

Similar content being viewed by others

4. References

  1. Bodlaender, H.L. and J. van Leeuwen, New upperbounds for decentralized extrema-finding in a ring of processors, Tech. Rep. RUU-CS-85-15, Dept. of Computer Science, University of Utrecht, Utrecht, 1985.

    Google Scholar 

  2. Burns, J.E., A formal model for message passing systems, Techn. Rep. 91, Computer Sci. Dept., Indiana University, Bloomington, IN., 1980.

    Google Scholar 

  3. Chandler, K.N., The distribution and frequency of record values, J. Roy. Stat. Soc., Series B, 14(1952) 220–228.

    Google Scholar 

  4. Chang, E., and R. Roberts, An improved algorithm for decentralized extremafinding in circular configurations of processes, C. ACM 22 (1979) 281–283.

    Google Scholar 

  5. David, F.N., and D.E. Barton, Combinatorial chance, Charles Griffin & Comp., London, 1962.

    Google Scholar 

  6. Dolev, D., M. Klawe, and M. Rodeh, An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle, J. Algorithm 3 (1982) 245–260.

    Google Scholar 

  7. Foster, F.G., and A. Stuart, Distribution-free tests in time-series based on the breaking of records, J. Roy. Stat. Soc., Series B, 16(1954) 1–13.

    Google Scholar 

  8. Franklin, W.R., On an improved algorithm for decentralized extrema finding in circular configurations of processors, C.ACM 25(1982) 336–337.

    Google Scholar 

  9. Gallager, R.G., P.A. Humblet, and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans. Prog. Lang. and Syst. 5(1983) 66–77.

    Google Scholar 

  10. Haghighi-Talab, D., and C. Wright, On the distribution of records in a finite sequence of observations, with an application to a road traffic problem, J. Appl. Prob. 10(1973) 556–571.

    Google Scholar 

  11. Hirschberg, D.S., and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processors, C.ACM 23(1980) 627–628.

    Google Scholar 

  12. Korach, E., D.Rotem, and N. Santoro, A probabilistic algorithm for decentralized extrema-finding in a circular configuration of processors, Res. Rep. CS-81-19, Dept. of Computer Science, Univ. of Waterloo, Waterloo, 1981.

    Google Scholar 

  13. LeLann, G., Distributed systems-towards a formal approach, in: B. Gilchrist (ed.), Information Processing 77 (IFIP), North-Holland Publ. Comp., Amsterdam, 1977, pp. 155–160.

    Google Scholar 

  14. Pachl, J., E. Korach, and D. Rotem, A technique for proving lower bounds for distributed maximum-finding algorithms, Proc. 14th ACM Symp. Theory of Computing, 1982, pp.378–382.

    Google Scholar 

  15. Peterson, G.L., An O(nlogn) unidirectional algorithm for the circular extrema problem, ACM Trans. Prog. Lang. and Syst. 4(1982) 758–762.

    Google Scholar 

  16. Renyi, A., Egy megfigyeléssorozat kiemelkedö elemeiröl (On the extreme elements of observations), MTA III. Oszt. Közl. 12(1962) 105–121.

    Google Scholar 

  17. Santoro, N., E. Korach, and D. Rotem, Decentralized extrema-finding in circular configurations of processors: and improved algorithm, Congr. Numer. 34(1982) 401–412.

    Google Scholar 

  18. van Leeuwen, J., and R.B. Tan, An improved upperbound for distributed election in bidirectional rings of processors, Tech. Rep. RUU-CS-85-23, Dept. of Computer Science, University of Utrecht, Utrecht, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O.Box 80.012, 3508 TA, Utrecht, the Netherlands

    H. L. Bodlaender & J. van Leeuwen

Authors
  1. H. L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., van Leeuwen, J. (1985). New upperbounds for decentralized extrema-finding in a ring of processors. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation