On fairness as an abstraction for the design of distributed systems

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

Research output: Contribution to conferencePaper

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

Fingerprint

Parallel algorithms

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

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, .

On fairness as an abstraction for the design of distributed systems. / Attie, Paul C.; Forman, Ira R.; Levy, Eliezer.

1990. 150-157 Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, .

Research output: Contribution to conferencePaper

Attie, PC, Forman, IR & Levy, E 1990, 'On fairness as an abstraction for the design of distributed systems', Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, 5/28/90 - 6/1/90 pp. 150-157.
Attie PC, Forman IR, Levy E. On fairness as an abstraction for the design of distributed systems. 1990. Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, .
Attie, Paul C. ; Forman, Ira R. ; Levy, Eliezer. / On fairness as an abstraction for the design of distributed systems. Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, .8 p.
@conference{5a69a67b82c146a69cd0fa5bdc73b452,
title = "On fairness as an abstraction for the design of distributed systems",
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.",
author = "Attie, {Paul C.} and Forman, {Ira R.} and Eliezer Levy",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
pages = "150--157",
note = "Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10 ; Conference date: 28-05-1990 Through 01-06-1990",

}

TY - CONF

T1 - On fairness as an abstraction for the design of distributed systems

AU - Attie, Paul C.

AU - Forman, Ira R.

AU - Levy, Eliezer

PY - 1990/12/1

Y1 - 1990/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025556183&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025556183&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0025556183

SP - 150

EP - 157

ER -