DocumentCode
2741377
Title
On fairness as an abstraction for the design of distributed systems
Author
Attie, Paul C. ; Forman, Ira R. ; Levy, Eliezer
Author_Institution
Microelectron. & Comput. Technol. Corp., Austin, TX, USA
fYear
1990
fDate
28 May-1 Jun 1990
Firstpage
150
Lastpage
157
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
Keywords
distributed processing; parallel algorithms; U-fairness; distributed algorithm; distributed coordination; distributed systems; fairness property; multiparty interactions; overlapping concurrency model; stable property detection; Broadcasting; Concrete; Concurrent computing; Distributed algorithms; Microelectronics; Proposals; State-space methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1990. Proceedings., 10th International Conference on
Conference_Location
Paris
Print_ISBN
0-8186-2048-X
Type
conf
DOI
10.1109/ICDCS.1990.89279
Filename
89279
Link To Document