✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms, Concurrency and Knowledge Volume 1023 || Detecting distributed termination in the presence of node failure

✍ Scribed by Kanchanasut, Kanchana; Lévy, Jean-Jacques

Book ID: 119949951
Publisher: Springer Berlin Heidelberg
Year: 1995
Weight: 764 KB
Category: Article
ISBN: 3540492623
DOI: 10.1007/3-540-60688-2_45

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] CONC

[Lecture Notes in Computer Science] CONCUR '96: Concurrency Theory Volume 1119 || Modelling and verification of Distributed Algorithms

✍ Montanari, Ugo; Sassone, Vladimiro 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 719 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel Algorithms and Architectures Volume 269 || Solutions for the distributed termination problem

✍ Albrecht, Andreas; Jung, Hermann; Mehlhorn, Kurt 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 471 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel and Distributed Processing Volume 1800 || Refinement based validation of an algorithm for detecting distributed termination

✍ Rolim, José 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 115 KB

This volume contains the proceedings from the workshops held in conjunction with the IEEE International Parallel and Distributed Processing Symposium, IPDPS 2000, on 1-5 May 2000 in Cancun, Mexico. The workshopsprovidea forum for bringing together researchers,practiti- ers, and designers from variou

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 87 Volume 247 || The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols

✍ Brandenburg, Franz J.; Vidal-Naquet, Guy; Wirsing, Martin 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 569 KB

[Lecture Notes in Computer Science] Foun

[Lecture Notes in Computer Science] Foundations of Software Technology and Theoretical Computer Science Volume 181 || A distributed algorithm for detecting communication deadlocks

✍ Joseph, Mathai; Shyamasundar, Rudrapatna 📂 Article 📅 1984 🏛 Springer Berlin Heidelberg ⚖ 929 KB

[Lecture Notes in Computer Science] Aspe

[Lecture Notes in Computer Science] Aspects and Prospects of Theoretical Computer Science Volume 464 || The distributed termination problem : Formal solution and correctness based on petri nets

✍ Dassow, Jürgen; Kelemen, Jozef 📂 Article 📅 1990 🏛 Springer Berlin Heidelberg ⚖ 806 KB