-
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case Distrib. Comput. (IF 1.3) Pub Date : 2024-03-22 Timothé Albouy, Davide Frey, Michel Raynal, François Taïani
-
Early adapting to trends: self-stabilizing information spread using passive communication Distrib. Comput. (IF 1.3) Pub Date : 2024-02-22 Amos Korman, Robin Vacus
-
Component stability in low-space massively parallel computation Distrib. Comput. (IF 1.3) Pub Date : 2024-02-08 Artur Czumaj, Peter Davies-Peck, Merav Parter
-
Distributed computing with the cloud Distrib. Comput. (IF 1.3) Pub Date : 2024-02-01 Yehuda Afek, Gal Giladi, Boaz Patt-Shamir
-
Expected linear round synchronization: the missing link for linear Byzantine SMR Distrib. Comput. (IF 1.3) Pub Date : 2024-01-08 Oded Naor, Idit Keidar
-
Byzantine consensus is $$\Theta (n^2)$$ : the Dolev-Reischuk bound is tight even in partial synchrony! Distrib. Comput. (IF 1.3) Pub Date : 2023-12-11 Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira
-
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts Distrib. Comput. (IF 1.3) Pub Date : 2023-07-31 Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
-
Near-optimal distributed computation of small vertex cuts Distrib. Comput. (IF 1.3) Pub Date : 2023-07-14 Merav Parter, Asaf Petruschka
-
Node and edge averaged complexities of local graph problems Distrib. Comput. (IF 1.3) Pub Date : 2023-07-05 Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti
-
Distributed computations in fully-defective networks Distrib. Comput. (IF 1.3) Pub Date : 2023-06-19 Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela
-
Lower bounds on the state complexity of population protocols Distrib. Comput. (IF 1.3) Pub Date : 2023-06-15 Philipp Czerner, Javier Esparza, Jérôme Leroux
Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol
-
Four shades of deterministic leader election in anonymous networks Distrib. Comput. (IF 1.3) Pub Date : 2023-05-31 Barun Gorain, Avery Miller, Andrzej Pelc
-
Permissionless and asynchronous asset transfer Distrib. Comput. (IF 1.3) Pub Date : 2023-05-18 Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh
-
Near-optimal distributed dominating set in bounded arboricity graphs Distrib. Comput. (IF 1.3) Pub Date : 2023-05-15 Michal Dory, Mohsen Ghaffari, Saeed Ilchi
-
Termination of amnesiac flooding Distrib. Comput. (IF 1.3) Pub Date : 2023-05-01 Walter Hussak, Amitabh Trehan
-
Cross-chain payment protocols with success guarantees Distrib. Comput. (IF 1.3) Pub Date : 2023-04-08 Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat
-
Phase transition of the k-majority dynamics in biased communication models Distrib. Comput. (IF 1.3) Pub Date : 2023-03-15 Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo
-
The canonical amoebot model: algorithms and concurrency control Distrib. Comput. (IF 1.3) Pub Date : 2023-02-17 Joshua J. Daymude, Andréa W. Richa, Christian Scheideler
-
Time-optimal construction of overlay networks Distrib. Comput. (IF 1.3) Pub Date : 2023-02-15 Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann
-
The splay-list: a distribution-adaptive concurrent skip-list Distrib. Comput. (IF 1.3) Pub Date : 2023-01-12 Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
-
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity Distrib. Comput. (IF 1.3) Pub Date : 2022-12-07 Armando Castañeda, Sergio Rajsbaum, Michel Raynal
-
Long-lived counters with polylogarithmic amortized step complexity Distrib. Comput. (IF 1.3) Pub Date : 2022-11-29 Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers
A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers,
-
Stochastic coordination in heterogeneous load balancing systems Distrib. Comput. (IF 1.3) Pub Date : 2022-10-12 Guy Goren, Shay Vargaftik, Yoram Moses
-
Reaching consensus for asynchronous distributed key generation Distrib. Comput. (IF 1.3) Pub Date : 2022-09-08 Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu
-
Making Byzantine consensus live Distrib. Comput. (IF 1.3) Pub Date : 2022-09-02 Manuel Bravo, Gregory Chockler, Alexey Gotsman
-
Locally checkable problems in rooted trees Distrib. Comput. (IF 1.3) Pub Date : 2022-08-22 Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
-
Improved weighted additive spanners Distrib. Comput. (IF 1.3) Pub Date : 2022-08-04 Michael Elkin, Yuval Gitlitz, Ofer Neiman
-
PerformERL: a performance testing framework for erlang Distrib. Comput. (IF 1.3) Pub Date : 2022-08-01 Walter Cazzola, Francesco Cesarini, Luca Tansini
-
Communication complexity of byzantine agreement, revisited Distrib. Comput. (IF 1.3) Pub Date : 2022-07-17 Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
-
The sum of its parts: Analysis of federated byzantine agreement systems Distrib. Comput. (IF 1.3) Pub Date : 2022-07-12 Martin Florian, Sebastian Henningsen, Charmaine Ndolo, Björn Scheuermann
-
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC Distrib. Comput. (IF 1.3) Pub Date : 2022-06-29 Michael Elkin, Ofer Neiman
Hopsets are a fundamental graph-theoretic and graph-algorithmic construct, and they are widely used for distance-related problems in a variety of computational settings. Currently existing constructions of hopsets produce hopsets either with \(\Omega (n \log n)\) edges, or with a hopbound \(n^{\Omega (1)}\). In this paper we devise a construction of linear-size hopsets with hopbound (ignoring the dependence
-
Genuinely distributed Byzantine machine learning Distrib. Comput. (IF 1.3) Pub Date : 2022-05-26 El-Mahdi El-Mhamdi, Rachid Guerraoui, Arsany Guirguis, Lê-Nguyên Hoang, Sébastien Rouault
-
Linial for lists Distrib. Comput. (IF 1.3) Pub Date : 2022-05-17 Yannic Maus, Tigran Tonoyan
Linial’s famous color reduction algorithm reduces a given m-coloring of a graph with maximum degree \(\varDelta \) to an \(O(\varDelta ^2\log m)\)-coloring, in a single round in the LOCAL model. We give a similar result when nodes are restricted to choose their color from a list of allowed colors: given an m-coloring in a directed graph of maximum outdegree \(\beta \), if every node has a list of size
-
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks Distrib. Comput. (IF 1.3) Pub Date : 2022-05-07 Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie
-
Extending the wait-free hierarchy to multi-threaded systems Distrib. Comput. (IF 1.3) Pub Date : 2022-04-16 Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza
-
Last-use opacity: a strong safety property for transactional memory with prerelease support Distrib. Comput. (IF 1.3) Pub Date : 2022-04-17 Konrad Siek, Paweł T. Wojciechowski
-
Distributed backup placement Distrib. Comput. (IF 1.3) Pub Date : 2022-03-24 Leonid Barenboim, Gal Oren
We consider the Backup Placement problem in networks in the \(\mathcal {CONGEST}\) distributed setting. Given a network graph \(G = (V,E)\), the goal of each vertex \(v \in V\) is selecting a neighbor, such that the maximum number of vertices in V that select the same vertex is minimized. The backup placement problem was introduced by Halldorsson, Kohler, Patt-Shamir, and Rawitz, who obtained in 2015
-
Asynchronous reconfiguration with Byzantine failures Distrib. Comput. (IF 1.3) Pub Date : 2022-03-10 Petr Kuznetsov, Andrei Tonkikh
Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable to maintain a reconfiguration mechanism that would replace faulty replicas with correct ones. An important challenge is to enable reconfiguration without affecting the availability and consistency of the replicated data: the clients should be able to get correct
-
Correction to: The consensus number of a cryptocurrency Distrib. Comput. (IF 1.3) Pub Date : 2022-02-23 Rachid Guerraoui,Petr Kuznetsov,Matteo Monti,Matej Pavlovic,Dragos-Adrian Seredinschi
-
Revisiting asynchronous fault tolerant computation with optimal resilience Distrib. Comput. (IF 1.3) Pub Date : 2022-02-03 Ittai Abraham, Danny Dolev, Gilad Stern
The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience
-
Byzantine gathering in polynomial time Distrib. Comput. (IF 1.3) Pub Date : 2022-01-21 Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani
Gathering is a key task in distributed and mobile systems, which becomes significantly harder if some agents are subject to Byzantine faults, known as being the worst ones. We propose here to study the task of Byzantine gathering in an arbitrary graph: despite the presence of Byzantine agents, the goal is to ensure that all the other (good) agents, executing the same algorithm, eventually meet at the
-
Equivalence classes and conditional hardness in massively parallel computations Distrib. Comput. (IF 1.3) Pub Date : 2022-01-20 Danupon Nanongkai, Michele Scquizzato
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such
-
Unbeatable consensus Distrib. Comput. (IF 1.3) Pub Date : 2022-01-12 Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper derives the first explicit unbeatable consensus protocols in the literature, for the standard synchronous message-passing model with crash failures. These
-
Strong eventual consistency of the collaborative editing framework WOOT Distrib. Comput. (IF 1.3) Pub Date : 2022-01-04 Karayel, Emin, Gonzàlez, Edgar
Commutative Replicated Data Types (CRDTs) are a promising new class of data structures for large-scale shared mutable content in applications that only require eventual consistency. The WithOut Operational Transforms (WOOT) framework is the first CRDT for collaborative text editing introduced by Oster et al. (In: Conference on Computer Supported Cooperative Work (CSCW). ACM, New York, pp 259–268, 2006a)
-
Distributed computation and reconfiguration in actively dynamic networks Distrib. Comput. (IF 1.3) Pub Date : 2021-12-19 Michail, Othon, Skretas, George, Spirakis, Paul G.
We study here systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration to carry out a given task. Also, the distributed task itself may now require a global reconfiguration from a given initial network \(G_s\) to a target network \(G_f\) from a desirable family
-
Single-source shortest paths in the CONGEST model with improved bounds Distrib. Comput. (IF 1.3) Pub Date : 2021-11-27 Chechik, Shiri, Mukhtar, Doron
Computing shortest paths from a single source is one of the central problems studied in the CONGEST model of distributed computing. After many years in which no algorithmic progress was made, Elkin [STOC ‘17] provided the first improvement over the distributed Bellman-Ford algorithm. Since then, several improved algorithms have been published. The state-of-the-art algorithm for weighted directed graphs
-
Sublinear-time distributed algorithms for detecting small cliques and even cycles Distrib. Comput. (IF 1.3) Pub Date : 2021-11-26 Eden, Talya, Fiat, Nimrod, Fischer, Orr, Kuhn, Fabian, Oshman, Rotem
In this paper we give sublinear-time distributed algorithms in the \(\mathsf {CONGEST}\) model for finding or listing cliques and even-length cycles. We show for the first time that all copies of 4-cliques and 5-cliques in the network graph can be detected and listed in sublinear time, \(O(n^{5/6+o(1)})\) rounds and \(O(n^{73/75+o(1)})\) rounds, respectively. For even-length cycles, \(C_{2k}\), we
-
Distributed bare-bones communication in wireless networks Distrib. Comput. (IF 1.3) Pub Date : 2021-11-25 Chlebus, Bogdan S., Kowalski, Dariusz R., Vaya, Shailesh
We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their neighborhoods, nor do they know the size of the network n, and finally they cannot sense collisions resulting from simultaneous transmissions by at least two neighbors
-
Dynamic scheduling in distributed transactional memory Distrib. Comput. (IF 1.3) Pub Date : 2021-11-20 Busch, Costas, Herlihy, Maurice, Popovic, Miroslav, Sharma, Gokarna
We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those objects have been assembled, and then sends the objects to other waiting transactions. We study scheduling algorithms with provable performance guarantees. Previously
-
-
Synthesizing optimal bias in randomized self-stabilization Distrib. Comput. (IF 1.3) Pub Date : 2021-11-08 Volk, Matthias, Bonakdarpour, Borzoo, Katoen, Joost-Pieter, Aflaki, Saba
Randomization is a key concept in distributed computing to tackle impossibility results. This also holds for self-stabilization in anonymous networks where coin flips are often used to break symmetry. Although the use of randomization in self-stabilizing algorithms is rather common, it is unclear what the optimal coin bias is so as to minimize the expected convergence time. This paper proposes a technique
-
On atomic registers and randomized consensus in M&M systems Distrib. Comput. (IF 1.3) Pub Date : 2021-10-27 Hadzilacos, Vassos, Hu, Xing, Toueg, Sam
Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called the message-and-memory model or m&m model for short. In this model, processes can communicate by message passing and also by accessing some shared memory (e.g., through some RDMA connections). We first consider the basic problem of implementing an atomic single-writer multi-reader
-
The consensus number of a cryptocurrency (extended version) Distrib. Comput. (IF 1.3) Pub Date : 2021-10-23 Guerraoui, Rachid, Kuznetsov, Petr, Monti, Matteo, Pavlovic, Matej, Seredinschi, Dragos-Adrian
Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spending; this is usually solved by achieving consensus on the order of transfers among the participants. In this paper, we treat the asset transfer
-
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications Distrib. Comput. (IF 1.3) Pub Date : 2021-10-23 Luna, Giuseppe A. Di, Flocchini, Paola, Santoro, Nicola, Viglietta, Giovanni
In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward its destination. Robots are punctiform and memoryless, they operate in \(\mathbb {R}^m\), they have local reference systems independent of each other, and are activated
-
Distributed computation with continual population growth Distrib. Comput. (IF 1.3) Pub Date : 2021-10-23 Cho, Da-Jung, Függer, Matthias, Hopper, Corbin, Kushwaha, Manish, Nowak, Thomas, Soubeyran, Quentin
Computing via synthetically engineered bacteria is a vibrant and active field with numerous applications in bio-production, bio-sensing, and medicine. Motivated by the lack of robustness and by resource limitation inside single cells, distributed approaches with communication among bacteria have recently gained in interest. In this paper, we focus on the problem of population growth happening concurrently
-
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs Distrib. Comput. (IF 1.3) Pub Date : 2021-09-13 Nguyen, Duong, Yingchareonthawornchai, Sorrachai, Tekken Valapil, Vidhya, Kulkarni, Sandeep S., Demirbas, Murat
Distributed programs are often designed with implicit assumptions about the underlying system. We focus on assumptions related to clock synchronization. When a program written with clock synchronization assumptions is monitored to determine if it satisfies its requirements, the monitor should also account for these assumptions precisely. Otherwise, the monitor will either miss potential bugs (false
-
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals Distrib. Comput. (IF 1.3) Pub Date : 2021-09-13 Anderton, William C., Chakraborty, Trisha, Young, Maxwell
Binary exponential backoff (BEB) is a decades -old algorithm for coordinating access to a shared channel. In modern networks, BEB plays a crucial role in WiFi and other wireless communication standards. Despite this track record, well-known theoretical results indicate that under bursty traffic, BEB yields poor makespan, and superior algorithms are possible. To date, the degree to which these findings
-
Low-congestion shortcut and graph parameters Distrib. Comput. (IF 1.3) Pub Date : 2021-08-28 Kitamura, Naoki, Kitagawa, Hirotaka, Otachi, Yota, Izumi, Taisuke
Distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound of \({\tilde{\Omega }}(\sqrt{n} + D)\) rounds for several global problems, where n denotes the number of nodes and D the diameter of the input graph. Because such a lower bound is derived from special “hard-core” instances, it does not necessarily apply to specific popular graph classes such as
-
Special issue on PODC 2018 and DISC 2018 Distrib. Comput. (IF 1.3) Pub Date : 2021-07-15 Hagit Attiya
-
Improved distributed $$\Delta $$ Δ -coloring Distrib. Comput. (IF 1.3) Pub Date : 2021-07-09 Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
We present a randomized distributed algorithm that computes a \(\Delta \)-coloring in any non-complete graph with maximum degree \(\Delta \ge 4\) in \(O(\log \Delta ) + 2^{O(\sqrt{\log \log n})}\) rounds, as well as a randomized algorithm that computes a \(\Delta \)-coloring in \(O((\log \log n)^2)\) rounds when \(\Delta \in [3, O(1)]\). Both these algorithms improve on an \(O(\log ^3 n / \log \Delta