This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Self-Stabilizing Strong Fairness under Weak Fairness
April 2001 (vol. 12 no. 4)
pp. 337-345

Abstract—Fairness assumptions have a great impact on distributed algorithms. They play a major role in determining the time complexity and the correctness of algorithms, since progress or freedom from various types of starvation may not be guaranteed without fairness assumptions. In this paper, we present a stabilizing deterministic algorithm allowing simultaneous execution of actions for strong fairness under weak fairness assumption. In addition, we show that the proposed algorithm yields a high degree of concurrency. We conclude the paper with some remarks on issues such as time optimal implementation of strong fairness and open problems related to fairness.

[1] K.R. Apt, N. Francez, and S. Katz, “Apprasing Fairness in Languages for Distributed Programming,” Distributed Computing, vol. 2, pp. 226-241, 1988.
[2] A. Arora and M.G. Gouda, “Distributed Reset,” IEEE Trans. Computers, vol. 43, pp. 1026-1038, 1994.
[3] B. Awerbuch and G. Varghese, "Distributed Program Checking a Paradigm for Building Self-Stabilizing Distributed Protocols," Proc. 31st Ann. IEEE Symp. Foundations of Computer Science, pp. 268-277, 1991.
[4] R.J.R Back and R. Kurki-Suonio, “Distributed Cooperation with Action Systems,” ACM TOPLAS, vol. 20, pp. 513-554, 1988.
[5] G.M. Brown, M.G. Gouda, and C.L. Wu, “Token Systems that Self-Stabilize,” IEEE Trans. Computing, vol. 38, no. 6, pp. 844-852, 1989.
[6] S.C. Bruell, S. Ghosh, M.H. Karaata, and S. Pemmaraju, “Self-Stabilizing Algorithms for Finding Centers and Medians of Trees,” SIAM J.Computing, vol. 29, no. 2, pp. 600-614, 1999.
[7] J.E. Burns and J. Pachl,“Uniform self-stabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989,.
[8] Edsger W. Dijkstra, Selected Writings on Computing: A Personal Perspective.New York: Springer Verlag, 1982, pp. 126-128.
[9] E.W. Dijkstra, "Guarded Commands, Nondeterminacy, and Formal Derivation of Programs," Comm. ACM, vol. 18, no. 8, pp. 453-457, Aug 1975.
[10] N. Francez, Fairness. New York: Springer Verlag, 1986.
[11] S. Ghosh and M.H. Karaata, “A Self-Stablizing Algorithm for Coloring Planar Graphs,” Distributed Computing, vol. 7, no. 1, pp. 55-59, 1993.
[12] M.G. Gouda and F. Haddix, “The Alternator,” Proc. Third Workshop Self-Stabilizing Systems (published in association with ICDCS99 The 19th IEEE Int'l Conf. Distributed Computing Systems), pp. 48-53, 1999.
[13] D. Hoover and J. Poole, “A Distributed Self-Stablizing Solution to the Dining Philosophers Problem,” Information Processing Letters, vol. 41, no. 4, pp. 209-213, Mar. 1992.
[14] S.T. Huang, “Leader Election in Uniform Rings,” ACM Trans. Programming Languages and Systems, vol. 15, pp. 563-573, 1993.
[15] A. Israeli and M. Li, “Bounded Time-Stamps,” Proc. 28th Annual Symp.Foundations of Computer Science, A.K. Chandra, ed. pp. 371-382, Oct. 1987.
[16] M. Hakan and K.P. Chaudhuri, “A Self-Stablizing Algorithm for Strong Fairness,” Computing, vol. 60, no. 2, pp. 217-228, 1998.
[17] S Katz and K.J. Perry, “Self-Stabilizing Extensions for Message-Passing Systems,” Distributed Computing, vol. 7, pp. 17-26, 1993.
[18] X. Lin and S. Ghosh, “Self-Stabilizing Maxima Finding,” Proc. 28th Annual Allerton Conf., pp. 662-671, 1991.
[19] M. Mizuno and M. Nesterenko, “A Transformation of Self-Stablizing Serial Model Programs for Asynchronous Parallel Computing Environments,” Information Processing Letters, vol. 66, no. 6, pp. 285-290, June 1998.
[20] M. Nesterenko and A. Arora, “Stabilization-Preserving Atomicity Refinement,” DISC99 Distributed Computing 13th Int'l Symp., pp. 254-268, 1999.
[21] M. Schneider, “Self-Stabilization,” ACM Computing Surveys, vol. 25, no. 1, pp. 45-67, Mar. 1993.
[22] P.A. Sistla, "Distributed Algorithms for Ensuring Fair Interprocess Communications," Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 266-277, 1984.
[23] S. Sur and P.K. Srimani, “A Self-Stablizing Distributed Algorithm for (BFS) Spanning Trees of a Symmetric Graph,” Parallel Processing Letters, vol. 2, pp. 171-179, 1992.

Index Terms:
Distributed systems, fairness, self-stabilization, strong fairness, schedulers.
Citation:
Mehmet Hakan Karaata, "Self-Stabilizing Strong Fairness under Weak Fairness," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 4, pp. 337-345, April 2001, doi:10.1109/71.920585
Usage of this product signifies your acceptance of the Terms of Use.