Fairness
Fairness in parallel programs: the transformational approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using raddle to design distributed systems
ICSE '88 Proceedings of the 10th international conference on Software engineering
Interacting processes: a multiparty approach to coordinated distributed programming
Interacting processes: a multiparty approach to coordinated distributed programming
Semantics of sequential and parallel programs
Semantics of sequential and parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A multiparty coordination aspect language
ACM SIGPLAN Notices
An enablement detection algorithm for open multiparty interactions
Proceedings of the 2002 ACM symposium on Applied computing
Introducing .NET
An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Fairness and hyperfairness in multi-party interactions
Distributed Computing
Generating non-conspiratorial executions
Information Processing Letters
Autonomous-Centered problem allocation oriented to cooperation
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
| Hi-index | 0.00 |
Strong fairness is a notion we can use to ensure that an element that is enabled infinitely often in a non-deterministic programme, will eventually be selected for execution so that it can progress. Unfortunately, "eventually" is too weak to induce the intuitive idea of liveliness and leads to anomalies that are not desirable, namely fair finiteness and conspiracies. In this paper, we focus on non-deterministic programmes based on multiparty interactions and we present a new criteria for selecting interactions called strong k-fairness that improves on other proposals in that it addresses both anomalies simultaneously, and k may be set a priori to control its goodness. We also show our notion is feasible, and present an algorithm for scheduling interactions in a strongly k-fair manner using a theoretical framework to support the multiparty interaction model. Our algorithm does not require to transform the source code to the processes that compose the system; furthermore, it can deal with both terminating and non-terminating processes.