Self-Stabilizing Strong Fairness under Weak Fairness

Authors:
Mehmet Hakan Karaata
Affiliations:
Univ. of Kuwait, Safat, Kuwait
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2001

Citing 18
Cited 10

Fairness

Fairness
Distributed cooperation with action systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize

IEEE Transactions on Computers
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A distributed self-stabilizing solution to the dining philosophers problem

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
Leader election in uniform rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
A self-stabilizing algorithm for strong fairness

Computing
A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

Information Processing Letters
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

SIAM Journal on Computing
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
Distributed Reset

IEEE Transactions on Computers
The alternator

ICDCS '99 Workshop on Self-stabilizing Systems
Distributed algorithms for ensuring fair interprocess communicatons

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Self-stabilizing extensions for message-passing systems

Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization

Stabilizing ring clustering

Journal of Systems Architecture: the EUROMICRO Journal
An optimal self-stabilizing strarvation-free alternator

Journal of Computer and System Sciences
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks

Computer Communications
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Self-stabilizing algorithms

Algorithms and theory of computation handbook
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
An application of snap-stabilization: matching in bipartite graphs

ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

Theoretical Computer Science
A distributed maximal scheduler for strong fairness

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.