𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time-optimal leader election in general networks

✍ Scribed by David Peleg

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
493 KB
Volume
8
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Optimal server allocation in general, fi
Optimal server allocation in general, finite, multi-server queueing networks
✍ J. MacGregor Smith; F. R. B. Cruz; T. van Woensel πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 510 KB

## Abstract Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series‐parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonst