Exact average message complexity values for distributed election on bidirectional rings of processors
From MaRDI portal
DOI10.1016/0304-3975(90)90162-BzbMATH Open0695.68040OpenAlexW1964069744MaRDI QIDQ910221FDOQ910221
Authors: Christian Lavault 
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90162-b
Recommendations
- Average number of messages for distributed leader finding in rings of processors
- Average number of messages for distributed leader-fitting in rings of processors
- Distributed election in a circle without a global sense of orientation
- Towards optimal distributed election on chordal rings
- Communication and time complexity of a distributed election protocol
Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Theory of operating systems (68N25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Théorie géométrique des polynômes eulériens
- A unifying look at data structures
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- Title not available (Why is that?)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
- Average number of messages for distributed leader-fitting in rings of processors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Exact average message complexity values for distributed election on bidirectional rings of processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910221)
