Fairness of shared objects

Michael Merritt, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationDistributed Computing - 12th International Symposium, DISC 1998, Proceedings
EditorsShay Kutten, Shay Kutten
PublisherSpringer Verlag
Pages303-317
Number of pages15
ISBN (Print)3540650660, 9783540650669
DOIs
StatePublished - 1998
Event12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece
Duration: 24 Sep 199826 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1499
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Distributed Computing, DISC 1998
Country/TerritoryGreece
CityAndros
Period24/09/9826/09/98

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Fingerprint

Dive into the research topics of 'Fairness of shared objects'. Together they form a unique fingerprint.

Cite this