On fairness as an abstraction for the design of distributed systems

Paul C. Attie, Ira R. Forman, Eliezer Levy

Research output: Contribution to conferencePaper

8 Scopus citations

Abstract

A fairness property, called U-fairness, is studied in the context of the design of distributed systems with multiparty interactions. This is done with an overlapping model of concurrency. A distributed algorithm implementing the fairness notion is presented. U-fairness is shown to be more appropriate to the design of distributed systems than other known fairness notions because it provides an abstraction for stable property detection whereas the other fairness notions do not.

Original languageEnglish (US)
Pages150-157
Number of pages8
StatePublished - Dec 1 1990
Externally publishedYes
EventProceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10 - Paris, Fr
Duration: May 28 1990Jun 1 1990

Conference

ConferenceProceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10
CityParis, Fr
Period5/28/906/1/90

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'On fairness as an abstraction for the design of distributed systems'. Together they form a unique fingerprint.

  • Cite this

    Attie, P. C., Forman, I. R., & Levy, E. (1990). On fairness as an abstraction for the design of distributed systems. 150-157. Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, .