✦ LIBER ✦

Real-time leader election

✍ Scribed by Gurdip Singh

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 448 KB
Volume: 49
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90028-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time-optimal leader election in general

Time-optimal leader election in general networks

✍ David Peleg 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Randomized leader election

✍ Murali Krishna Ramanathan; Ronaldo A. Ferreira; Suresh Jagannathan; Ananth Grama 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 517 KB

Optimal Time–Space Tradeoff for Shared M

Optimal Time–Space Tradeoff for Shared Memory Leader Election

✍ Yehuda Afek; Gideon Stupp 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between the size of the register and its computational po

Leader election in oriented star graphs

✍ Wei Shi; A. Bouabdallah; Pradip K Srimani 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

SEIU elects new leaders

📂 Article 📅 1996 🏛 John Wiley and Sons ⚖ 132 KB

No part of this pulilication may br repro-t1ucc.d in any form or by m y mi.:ins. rxcept iis permitted under Section 107 or IOH of the 1976 U n i t i d St;iti,s Copyright Act. without either thv prior \crit:rn permission of the puhlishrr nr ;iuthoriz;ition through the C'npyright Clwrance C'eritcr. 22

Algorithms for Leader Election by Cellul

Algorithms for Leader Election by Cellular Automata

✍ Codrin Nichitiu; Jacques Mazoyer; Eric Rémila 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present two cellular algorithms, in O n and respectively in O w 2 , for the leader election problem on finite connected rings F and respectively finite connected subsets of d , of eccentricity w, for any fixed d. The problem consists of finding an algorithm such that when setting the elements of