Distributed termination detection in reducible communication graphs

A distributed termination detection (DTD) algorithm is presented that can be superimposed upon a diffusing computation in which channels are unidirectional and the communication graph is reducible. A flow graph with the source node s is reducible if it can be transformed into a single node by repeat...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1994-01, Vol.49 (1), p.1-8
1. Verfasser:	Gianuzzi, Vittoria
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Distributed computing Distributed processing Exact sciences and technology Graphs Information retrieval. Graph Reducible graphs Studies Termination detection Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!