Zobrazeno 1 - 10
of 259
pro vyhledávání: '"Gilbert, Seth"'
Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent data structures, which are relatively easy to derive from their sequential counterparts and t
Externí odkaz:
http://arxiv.org/abs/2408.13779
Autor:
Civit, Pierre, Dzulfikar, Muhammad Ayaz, Gilbert, Seth, Guerraoui, Rachid, Komatovic, Jovan, Vidigueira, Manuel, Zablotchi, Igor
Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity of Byzantine agreement in synchrony. This has culminated in COOL,
Externí odkaz:
http://arxiv.org/abs/2403.08374
Contention resolution addresses the challenge of coordinating access by multiple processes to a shared resource such as memory, disk storage, or a communication channel. Originally spurred by challenges in database systems and bus networks, contentio
Externí odkaz:
http://arxiv.org/abs/2403.03876
Autor:
Civit, Pierre, Dzulfikar, Muhammad Ayaz, Gilbert, Seth, Guerraoui, Rachid, Komatovic, Jovan, Vidigueira, Manuel, Zablotchi, Igor
Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzantine agreement exchanges Omega(n^2) bits. In synchronous networks, sol
Externí odkaz:
http://arxiv.org/abs/2402.10059
Autor:
Civit, Pierre, Gilbert, Seth, Guerraoui, Rachid, Komatovic, Jovan, Paramonov, Anton, Vidigueira, Manuel
Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually decide (ter
Externí odkaz:
http://arxiv.org/abs/2311.08060
The strong Byzantine agreement (SBA) problem is defined among n processes, out of which t < n can be faulty and behave arbitrarily. SBA allows correct (non-faulty) processes to agree on a common value. Moreover, if all correct processes have proposed
Externí odkaz:
http://arxiv.org/abs/2308.03524
Autor:
Civit, Pierre, Gilbert, Seth, Guerraoui, Rachid, Komatovic, Jovan, Monti, Matteo, Vidigueira, Manuel
Consensus enables n processes to agree on a common valid L-bit value, despite t < n/3 processes being faulty and acting arbitrarily. A long line of work has been dedicated to improving the worst-case communication complexity of consensus in partial s
Externí odkaz:
http://arxiv.org/abs/2306.00431
Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is successfully sent if no other packet is also transmitted during that slot.
Externí odkaz:
http://arxiv.org/abs/2302.07751
The Byzantine consensus problem involves $n$ processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiring correct (non-faulty) processes to eventually reach a decision, (2)
Externí odkaz:
http://arxiv.org/abs/2301.04920