✦ LIBER ✦

A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

✍ Scribed by Tetz C. Huang; Ji-Cherng Lin; Nathan Mou

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 719 KB
Volume: 48
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.01.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for the sho

A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

✍ Tetz C. Huang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Shortest path finding has a variety of applications in transportation and communication. In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The prevlotm works on this topic had two assumptions that can be relaxed in this paper.

A self-stabilizing algorithm for finding

A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

✍ Tetz C. Huang; Ji-Cherng Lin; Chih-Yuan Chen; Cheng-Pin Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 202 KB

A 2-dominating set in a distributed system is a set of processors such that each processor outside the set has at least two neighbors in the set. In applications, a 2-dominating set can be considered as an ideal place in the system for allocating resources, and a minimal 2-dominating set allows for