Skip to main content
SpringerLink
Log in

Asymptotically optimal election on weighted rings

  • Conference paper
  • First Online:
Book cover Algorithm Theory — SWAT '94 (SWAT 1994)

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

Included in the following conference series:

Abstract

In general, in a network of asynchronous processors, the cost to send a message will differ from one communication link to another. In such a setting, it is desirable to factor the cost of links into the cost of distributed computation. Assume that associated with each link is a positive weight representing the cost of sending one message along the link and the cost of an algorithm executed on a weighted network is the sum of the costs of all messages sent during its execution. We determine the asymptotic complexity of distributed leader election on a weighted unidirectional asynchronous ring assuming this notion of cost, by exhibiting a simpie algorithm and a matching lower bound for the problem.

This research was supported in part by the Natural Sciences and Engineering Research Council of Canada.

Part of this research was carried out while visiting the University of Calgary in August 1993.

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. Dolev, M. Klawe, and M. Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms, 3(3):245–260, 1982.

    Google Scholar 

  2. L. Higham and T. Przytycka. A simple, efficient algorithm for maximum finding on rings. Technical Report 92/494/32, University of Calgary, 1992.

    Google Scholar 

  3. L. Higham and T. Przytycka. A simple, efficient algorithm for maximum finding on rings. In Lecture Notes in Computer Science #725, pages 249–263. Springer Verlag, 1993. Proc. 7th International Workshop on Distributed Algorithms.

    Google Scholar 

  4. J. Pachl, E. Korach, and D. Rotem. Lower bounds for distributed maximum finding. J. Assoc. Comput. Mach., 31(4):905–918, 1984.

    MathSciNet  Google Scholar 

  5. G. Peterson. An O(n log n) algorithm for the circular extrema problem. ACM Trans. on Prog. Lang. and Systems, 4(4):758–752, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Calgary, T2N 1N4, Calgary, Alberta, Canada

    Lisa Higham

  2. Dept. of Mathematics and Computer Science, Odense University, DK-5230, Odense M, Denmark

    Teresa Przytycka

Authors
  1. Lisa Higham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teresa Przytycka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Higham, L., Przytycka, T. (1994). Asymptotically optimal election on weighted rings. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation