article · 2007

Fairness of Shared Objects (Extended Abstract)

Michael Merritt, Gadi Taubenfeld

Cited by 0Abstract and details only

Abstract

) Michael Merritt ? Gadi Taubenfeld ?? Abstract. Fairness in concurrent systems can be viewed as an abstraction that bridges low-level timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems. 1 Introduction 1.1 Motivation Fairness is a powerful abstraction that has led to fruitful results in the theory of concurrent, distributed and nondeterministic programs. Various notions of fairness can be explained very briefly, but small differences have important consequences on the computability and complexity of concurrent systems. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems. While some previous wo...

Cite this paper

APA 7

Merritt, M., & Taubenfeld, G. (2007). Fairness of Shared Objects (Extended Abstract).

MLA 9

Merritt, Michael, and Gadi Taubenfeld. “Fairness of Shared Objects (Extended Abstract).” 2007.

Chicago

Merritt, Michael, and Gadi Taubenfeld. 2007. “Fairness of Shared Objects (Extended Abstract).”

Harvard

Merritt, M. and Taubenfeld, G. (2007) ‘Fairness of Shared Objects (Extended Abstract)’.

BibTeX

@article{merritt2007fairness,
  title = {{Fairness of Shared Objects (Extended Abstract)}},
  author = {Merritt, Michael and Taubenfeld, Gadi},
  year = {2007}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.