Premium
Fairness in systems based on multiparty interactions
Author(s) -
Ruiz David,
Corchuelo Rafael,
Toro Miguel
Publication year - 2003
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.782
Subject(s) - computer science , interleaving , a priori and a posteriori , set (abstract data type) , context (archaeology) , control (management) , theoretical computer science , distributed computing , programming language , artificial intelligence , epistemology , paleontology , philosophy , biology , operating system
In the context of the Multiparty Interaction Model, fairness is used to insure that an interaction that is enabled sufficiently often in a concurrent program will eventually be selected for execution. Unfortunately, this notion does not take conspiracies into account, i.e. situations in which an interaction never becomes enabled because of an unfortunate interleaving of independent actions; furthermore, eventual execution is usually too weak for practical purposes since this concept can only be used in the context of infinite executions. In this article, we present a new fairness notion, k ‐ conspiracy‐free fairness , that improves on others because it takes finite executions into account, alleviates conspiracies that are not inherent to a program, and k may be set a priori to control its goodness to address the above‐mentioned problems. Copyright © 2003 John Wiley & Sons, Ltd.