Výsledky vyhledávání - "randomized distributed algorithm"

Randomized consensus with regular registers Autor Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…•The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows…”
Získat plný text

Sharing random bits with no process coordination Autor Zimand, M.

“…The authors present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs…”
Získat plný text

On setting-up asynchronous ad hoc wireless networks Autor Jurdzinski, Tomasz, Kowalski, Dariusz R., Rozanski, Michal, Stachowiak, Grzegorz

“…This paper studies the task of setting up ad hoc wireless networks. In such networks, it is often the case that nodes become active at different times, without…”
Získat plný text

Randomized generation of acyclic orientations upon anonymous distributed systems Autor Arantes, Gladstone M., França, Felipe M.G., Martinhon, Carlos A.

“…This paper presents two new randomized distributed algorithms for the generation of acyclic orientations upon anonymous distributed systems of arbitrary…”
Získat plný text

Uniform dynamic self-stabilizing leader election Autor Dolev, S., Israeli, A., Moran, S.

“…A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without…”
Získat plný text

Coupling and self-stabilization Autor Fribourg, Laurent, Messika, Stéphane, Picaronny, laudine

“…A randomized self-stabilizing algorithm is an algorithm that, whatever the initial configuration is, reaches a set of М legal configurations} in finite time…”
Získat plný text

Tight bounds for FEC-based reliable multicast Autor Attiya, Hagit, Shachnai, Hadas

“…We study the problem of reliable multicast of a message to a set of receivers over a network that uses best effort transmission (e.g., ATM), based on forward…”
Získat plný text

Analyzing expected time by scheduler-luck games Autor Dolev, S., Israeli, A., Moran, S.

“…We introduce a novel technique, the scheduler luck game (in short sl-game) for analyzing the performance of randomized distributed protocols. We apply it in…”
Získat plný text

Lower Bounds for Randomized Mutual Exclusion Autor Kushilevitz, Eyal, Mansour, Yishay, Rabin, Michael O., Zuckerman, David

“…We establish, for the first time, lower bounds for randomized mutual exclusion algorithms (with a read-modify-write operation). Our main result is that a…”
Získat plný text

Device discovery in short-range wireless ad hoc networks Autor Popovski, P., Kozlova, T., Gavrilovska, L., Prasad, R.

“…The performance of many envisioned applications in short-range wireless ad hoc networking will critically rely on the promptness of the self-configuring…”
Získat plný text