𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for Leader Election by Cellular Automata

✍ Scribed by Codrin Nichitiu; Jacques Mazoyer; Eric Rémila

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
224 KB
Volume
41
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

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 F to a special state, and all the others to a state #, the cellular automaton iterates a finite number of steps and sets only one precise element of F to a special state called leader state, and all the others to a different state. We describe the algorithms in detail, give their proofs and complexities, and discuss the possible extensions.

📜 SIMILAR VOLUMES

A Self-Stabilizing Leader Election Algor
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
✍ Gheorghe Antonoiu; Pradip K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

Non-standard computation: Molecular comp
Non-standard computation: Molecular computation, cellular automata, evolutionary algorithms, quantum computers: By Tino Gramß, Stefan Bornholdt, Michael Groß, Melanie Mitchell and Thomas Pellizzari. Wiley-VCH, Weinheim, Germany. (1998). 221 pages. $34.95
📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 69 KB

& Sons, Inc., Chichester. (1999) . 380 pages. $65.00. Contents: Preface. Acronyms, notation, and symbols. I. General matrix theory and linear dynamical systems. 1. Matrices, matrix pencils, and rational matrix functions. 2. Linear dynamical systems. II. Generalized Riccati theory. 3. Popov triplet