• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-26
Chaya Ganesh, Arpita Patra

The problems of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both the distributed computing and cryptography communities. Extension protocols for these primitives have been introduced to handle long messages efficiently at the cost of small number of single-bit broadcasts, referred to as seed broadcasts. While the communication optimality has remained the most sought-after

更新日期：2020-07-26
• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-24
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic

Distributed optimization algorithms are frequently faced with solving sub-problems on disjoint connected parts of a network. Unfortunately, the diameter of these parts can be significantly larger than the diameter of the underlying network, leading to slow running times. This phenomenon can be seen as the broad underlying reason for the pervasive $$\tilde{\Omega }(\sqrt{n} + D)$$ lower bounds that

更新日期：2020-07-24
• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-13
Reut Levi, Moti Medina, Dana Ron

We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (Proceedings of the 30th International Symposium on Distributed Computing, pp. 43–56, 2016), who recently initiated the study of property testing in the distributed setting, our algorithm gives the following guarantee: For a

更新日期：2020-07-14
• Distrib. Comput. (IF 0.894) Pub Date : 2020-06-22
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli

We consider the problem of computing approximate Nash equilibria in monotone congestion games (a class of games generalizing network congestion games) with polynomially decreasing cost functions. In particular, we consider the case in which each resource j has a cost $$c_j$$ and the cost that each player incurs when using j is given by $$c_j/x^{\beta }$$ for some constant $${\beta }>0$$, where x is

更新日期：2020-06-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-28
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf

We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: A $$(2+\epsilon )$$-approximation for all-pairs shortest paths in $$O(\log ^2{n} / \epsilon )$$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation

更新日期：2020-05-28
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-26
Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas Nicolaou, Alexandru Popa, Alexander A. Schwarzmann

Communication cost is the most commonly used metric in assessing the efficiency of operations in distributed algorithms for message-passing environments. In doing so, the standing assumption is that the cost of local computation is negligible compared to the cost of communication. However, in many cases, operation implementations rely on complex computations that should not be ignored. Therefore, a

更新日期：2020-05-26
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-06
Eric E. Severson, David Haley, David Doty

We study the composability of discrete chemical reaction networks (CRNs) that stably compute (i.e., with probability 0 of error) integer-valued functions $$f:\mathbb {N}^d\rightarrow \mathbb {N}$$. We consider output-oblivious CRNs in which the output species is never a reactant (input) to any reaction. The class of output-oblivious CRNs is fundamental, appearing in earlier studies of CRN computation

更新日期：2020-05-06
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-25
Giuseppe A. Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta

In this paper we investigate the computational power of population protocols under some unreliable or weaker interaction models. More precisely, we focus on two features related to the power of interactions: omission failures and one-way communications. An omission failure, a notion that this paper introduces for the first time in the context of population protocols, is the loss by one or both parties

更新日期：2020-04-25
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-21
David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg

The set agreement power of a shared object O describes O’s ability to solve set agreement problems: it is the sequence $$(n_1, n_2, {\ldots }, n_k, {\ldots })$$ such that, for every $$k\ge 1$$, using O and registers one can solve the k-set agreement problem among at most $$n_k$$ processes. It has been shown that the ability of an object O to implement other objects is not fully characterized by its

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-18
Keren Censor-Hillel, Merav Parter, Gregory Schwartzman

This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send $$O(\log n)$$-bit messages in each round of communication. Our framework mostly follows

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-18
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela

The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the $$\mathsf {LOCAL}$$ model and locally checkable problems ($$\mathsf {LCL}$$s) in bounded-degree graphs, the following picture emerges: There are lots of problems with time complexities of $$\varTheta (\log ^* n)$$ or $$\varTheta (\log n)$$. It

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-09
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen

We introduce a novel lower bound technique for distributed graph algorithms under bandwidth limitations. We define the notion of fooling views and exemplify its strength by proving two new lower bounds for triangle membership in the Congest$$(B)$$ model: 1. Any 1-round algorithm requires $$B\ge c\varDelta \log n$$ for a constant $$c>0$$. 2. If $$B=1$$, even in constant-degree graphs any algorithm must

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-06-13
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc

Given a boolean predicate on labeled networks (e.g., the network is acyclic, or the network is properly colored, etc.), deciding in a distributed manner whether a given labeled network satisfies that predicate typically consists, in the standard setting, of every node inspecting its close neighborhood, and outputting a boolean verdict, such that the network satisfies the predicate if and only if all

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-16
Keren Censor-Hillel, Michal Dory

The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G, such that $$T \cup Aug$$ is 2-edge-connected. TAP has been widely studied in the sequential setting. The best known approximation ratio of 2 for the weighted case dates back to the work of Frederickson

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-06-19

We study the effect of different progress conditions on the computability of distributed systems. For a system with n processes, we define exponentially many new progress conditions and explore their properties and relative strength. We cover many known and new interesting conditions and propose a new classification for evaluating the strength of shared objects. The classification is based on finding

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-21
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson

This paper focuses on studying the message complexity of implicit leader election in synchronous distributed networks of diameter two. Kutten et al. (J ACM 62(1):7:1–7:27, 2015) showed a fundamental lower bound of $$\varOmega (m)$$ (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-09-04
Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu

For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory location, it makes sense to consider combining the instructions supported by different objects, rather than considering collections of different objects.

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-22
Panagiota Fatourou, Nikolaos D. Kallimanis

A universal construction is a general mechanism for obtaining a concurrent implementation of any shared object from its sequential implementation. We present the family of RedBlue universal constructions which produce adaptive, linearizable, wait-free, concurrent implementations of shared objects. The proposed universal constructions improve upon previous universal constructions in terms of their step

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-20
Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications. The input to the problem is a graph G that has n vertices and the set of edges partitioned over k sites, and an approximation ratio

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-03
Sebastian Brandt, Jara Uitto, Roger Wattenhofer

Recently, there has been a growing interest in grid exploration by agents with limited capabilities. We show that the grid cannot be explored by three semi-synchronous finite automata, answering an open question by Emek et al. (Theor Comput Sci 608:255–267, 2015) in the negative. In the setting we consider, time is divided into discrete steps, where in each step, an adversarially selected subset of

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2018-08-20
G. Di Luna, S. Dobrev, P. Flocchini, N. Santoro

In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the main focus has been on graphs that are static; that is, the topology is either invariant in time or subject to localized changes. The few studies on exploration

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-03-16
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi

Shape formation (or pattern formation) is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter, where entities are assumed to be small and with severely limited capabilities. Namely, it has been studied in the geometric Amoebot model, where the anonymous

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-08-07
Irvan Jahja, Haifeng Yu, Yuda Zhao

This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel $$\varOmega (d + \text{ poly }(m))$$ lower bounds on their time complexity (in rounds). Here d is the dynamic diameter of the dynamic network and m is the total number of nodes. Before this work, the only known lower bounds on these problems under oblivious adversaries

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-12-21

The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given graph H, the input network contains a subgraph isomorphic to H or not. We investigate this problem for H being a clique $$K_{\ell }$$ in the classical distributed CONGEST model, where the communication topology is the same

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-12-03
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski

Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of this reliability and efficiency derives from processes collaborating, sharing the work of distributing information. As a result of this collaboration, processes may receive information that was not originally intended for them. For example, some process may act as an intermediary

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2017-03-07
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny

We consider the problem of searching on a line using n mobile robots, of which at most f are faulty, and the remaining are reliable. The robots start at the same location and move in parallel along the line with the same speed. There is a target placed on the line at a location unknown to the robots. Reliable robots can find the target when they reach its location, but faulty robots cannot detect the

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-11-11
Shady Issa, Pascal Felber, Alexander Matveev, Paolo Romano

Transactional memory (TM) aims at simplifying concurrent programming via the familiar abstraction of atomic transactions. Recently, Intel and IBM have integrated hardware based TM (HTM) implementations in commodity processors, paving the way for the mainstream adoption of the TM paradigm. Yet, existing HTM implementations suffer from a crucial limitation, which hampers the adoption of HTM as a general

更新日期：2019-11-11
• Distrib. Comput. (IF 0.894) Pub Date : 2014-01-01
Heinrich Moser,Ulrich Schmid

We present generic transformations, which allow to translate classic fault-tolerant distributed algorithms and their correctness proofs into a real-time distributed computing model (and vice versa). Owing to the non-zero-time, non-preemptible state transitions employed in our real-time model, scheduling and queuing effects (which are inherently abstracted away in classic zero step-time models, sometimes

更新日期：2019-11-01
• Distrib. Comput. (IF 0.894) Pub Date : null
Benjamin Aminof,Tomer Kotek,Sasha Rubin,Francesco Spegni,Helmut Veith

Parameterized model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the parameterized model checking problem is to reduce it to model checking finitely many finite-state systems. This work considers the theoretical power and limitations of this technique. We focus on concurrent systems in which processes

更新日期：2019-11-01
• Distrib. Comput. (IF 0.894) Pub Date : 2019-07-06
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen

Modern cryptocurrency systems, such as the Ethereum project, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times, always without real concurrency. First, all smart contracts are serially executed by miners before appending them to the blockchain. Later, those contracts are serially re-executed by validators to verify that

更新日期：2019-07-06
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-31
Chen Avin, Kaushik Mondal, Stefan Schmid

Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload. Motivated

更新日期：2019-05-31
• Distrib. Comput. (IF 0.894) Pub Date : 2019-02-04
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto

The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic distributed

更新日期：2019-02-04
• Distrib. Comput. (IF 0.894) Pub Date : 2018-10-04
Manuela Fischer

We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results

更新日期：2018-10-04
• Distrib. Comput. (IF 0.894) Pub Date : 2018-04-27
Weiming Feng, Yuxin Sun, Yitong Yin

The local computation of Linial [FOCS’87] and Naor and Stockmeyer [STOC’93] studies whether a locally defined distributed computing problem is locally solvable. In classic local computation tasks, the goal of distributed algorithms is to construct a feasible solution for some constraint satisfaction problem (CSP) locally defined on the network. In this paper, we consider the problem of sampling a uniform

更新日期：2018-04-27
Contents have been reproduced by permission of the publishers.

down
wechat
bug