Simulating synchronous processors (Q578903)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simulating synchronous processors |
scientific article; zbMATH DE number 4014016
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulating synchronous processors |
scientific article; zbMATH DE number 4014016 |
Statements
Simulating synchronous processors (English)
0 references
1987
0 references
In this paper we show how a distributed system with synchronous processors and asynchronous message delays can be simulated by a system with both asynchronous processors and asynchronous message delays in the presence of various types of processor faults. Consequently, the result of \textit{M. Fischer}, \textit{N. Lynch} and \textit{M. Paterson} [J. Assoc. Comput. Mach. 32, 374-382 (1985)] that no consensus protocol for asynchronous processors and communication can tolerate one failstop fault, implies a result of \textit{D. Dolev}, \textit{C. Dwork} and \textit{L. Stockmeyer} [J. Assoc. Comput. Mach. 34 (1987)] that no consensus protocol for synchronous processors and asynchronous communication can tolerate one failstop fault.
0 references
distributed system
0 references
synchronous processors
0 references
asynchronous message delays
0 references
processor faults
0 references
protocol
0 references
communication
0 references
failstop fault
0 references
0.86406714
0 references
0.8551348
0 references
0.85152054
0 references