Global stability detection in the asynchronous distributed computations

A simple algorithm for detecting global stability in asynchronous distributed computations is presented. it is based on observation of the outgoing channels, using a single token which acts as observer. No vector is necessary (in the transmission of the token on the ring), and this algorithm does no...

Full description

Saved in:
Bibliographic Details
Published inWorkshop on the Future Trends of Distributed Computing Systems in the 1990s: Proceedings pp. 87 - 92
Main Author Naimi, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Communication channels
Computational modeling
Computer networks
Concurrent computing
Distributed algorithms
Distributed computing
Intelligent networks
Process design
Stability
System recovery
Online AccessGet full text
ISBN9780818608971
0818608978
DOI10.1109/FTDCS.1988.26684

Cover

More Information
Summary:A simple algorithm for detecting global stability in asynchronous distributed computations is presented. it is based on observation of the outgoing channels, using a single token which acts as observer. No vector is necessary (in the transmission of the token on the ring), and this algorithm does not require the first-in/first-out (FIFO) property for the communication channels.< >
ISBN:9780818608971
0818608978
DOI:10.1109/FTDCS.1988.26684