Mutual exclusion of locally byzantine processes

A solution of the mutual exclusion problem for processes that can have byzantine behavior, except for particular sections of their code, is presented. The problem is to design a protocol to ensure that, at a given time, no more than one process is executing in its own critical section. The protocol...

Full description

Saved in:
Bibliographic Details
Published inWorkshop on the Future Trends of Distributed Computing Systems in the 1990s: Proceedings pp. 232 - 236
Main Author Beauquier, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Computer crashes
Delay
Distributed control
Fault detection
Fault tolerant systems
Permission
Protocols
System recovery
Online AccessGet full text
ISBN9780818608971
0818608978
DOI10.1109/FTDCS.1988.26702

Cover

More Information
Summary:A solution of the mutual exclusion problem for processes that can have byzantine behavior, except for particular sections of their code, is presented. The problem is to design a protocol to ensure that, at a given time, no more than one process is executing in its own critical section. The protocol must yield some fairness, absence of starvation, and deadlock requirements. It is assumed that distributed processes can become faulty in all parts of their code except a special reduced part. It is asserted that this assumption makes a solution to the problem possible.< >
ISBN:9780818608971
0818608978
DOI:10.1109/FTDCS.1988.26702