Progress under bounded fairness

作     者：Hesselink, WH 

作者机构：Univ Groningen Dept Math & Comp Sci NL-9700 AV Groningen Netherlands 

出 版 物：《DISTRIBUTED COMPUTING》 (分布式计算)

年 卷 期：1999年第12卷第4期

页      面：197-207页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：bounded fairness concurrent data object fault tolerance memory management client server architecture 

摘      要：Progress is investigated for a shared-memory distributed system with a weak form of fault tolerance that allows processes to stop and restart functioning without notification. The concept of bounded fairness is introduced to formalize bounded delay under the assumption that each family of related processes continuously contains at least one active member. This is a generalization of wait-freedom, and also of a finitary form of weak fairness. Several useful proof rules are stated and proved. In a system with bounded fairness, a wait-free process can be constructed by forming a new process in which processes from the various families are scheduled in a round robin way. The theory is applied to prove progress within bounded delay for a linearizing concurrent data-object in shared memory. The safety properties of this algorithm have been treated elsewhere.