Skip to main content
SpringerLink
Log in

A self-stabilizing algorithm for strong fairness

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Self-stabilization is a novel technique to deal with faults in distributed systems. This paper presents a distributed self-stabilizing algorithm for implementing strong fairness in an arbitrary network. A desirable feature of this algorithm is that it can be used to enforce the strong fairness property on any distributed algorithm including self-stabilizing algorithms. In addition, the algorithm does not require any initialization and can withstand transient failures. At the end of the paper such issues as improving the time complexity of the proposed algorithm and the limitations on the efficiency of any implementation of strong fairness are discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K. R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distr. Computing2, 226–241 (1988).

    Article  MATH  Google Scholar 

  2. Chaudhuri, P.: An algorithm for distributed mutual exclusion. Inf. Software Technol.37, 375–381 (1995).

    Article  Google Scholar 

  3. Chen, F. P., Yu, N. S., Huang, S. T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Proc. Lett.39, 147–151 (1991).

    Article  MATH  Google Scholar 

  4. Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Inf. Proc. Lett.49, 297–301 (1994).

    Article  MATH  Google Scholar 

  5. Dijkstra, E. W.: Self-stabilizing systems in spite of distributed control. Comm. ACM17, 643–644 (1974).

    Article  MATH  Google Scholar 

  6. Francez, N.: Fairness. New York: Springer 1986.

    MATH  Google Scholar 

  7. Huang, S. T., Chen, N. S.: Self-stabilizing depth-first token circulation on networks. Distr. Comput.7, 61–66 (1993).

    Article  Google Scholar 

  8. Karaata, M. H., Chaudhuri, P.: A distributed algorithm for implementing strong fairness. Kuwait University Internal Report 1997.

  9. Lamport, L.: The mutual exclusion problem: part ii—statement and solutions. J. ACM33, 327–348 (1986).

    Article  MATH  Google Scholar 

  10. Maekawa, M.: A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst.3, 145–159 (1985).

    Article  Google Scholar 

  11. Ricart, G., Agrawala A. K.: An optimal algorithm for mutual exclusion in computer networks. Comm. ACM24, 9–17 (1981).

    Article  Google Scholar 

  12. Schneider, M.: Self-stabilization. ACM Comput. Surv.25, 45–67 (1993).

    Article  Google Scholar 

  13. Wedde, H.: An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives. Theor. Comput. Sci.242, 1–20 (1983).

    Article  Google Scholar 

  14. Winkowski, J.: Protocols of accessing overlapping sets of resources. Inf. Proc. Lett.12, 239–243 (1981).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969, 13060, Safat, Kuwait

    M. H. Karaata & P. Chaudhuri

Authors
  1. M. H. Karaata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karaata, M.H., Chaudhuri, P. A self-stabilizing algorithm for strong fairness. Computing 60, 217–228 (1998). https://doi.org/10.1007/BF02684333

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words

Search

Navigation