Proceedings of the ... International Symposium on High Performance Distributed Computing最新文献_第10页

Coloring Fast Without Learning Your Neighbors' Colors 在不学习邻居颜色的情况下快速着色

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-10 DOI: 10.4230/LIPIcs.DISC.2020.39

M. Halldórsson, F. Kuhn, Yannic Maus, Alexandre Nolin

引用次数: 9

Leaderless State-Machine Replication: Specification, Properties, Limits (Extended Version) 无领导状态机复制:规范，属性，限制(扩展版)

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-06 DOI: 10.4230/LIPIcs.DISC.2020.24

T. F. Rezende, P. Sutra

引用次数: 7

Efficient Multi-word Compare and Swap 高效的多字比较和交换

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-06 DOI: 10.4230/LIPIcs.DISC.2020.4

R. Guerraoui, Alex Kogan, Virendra J. Marathe, I. Zablotchi

引用次数: 10

Singularly Optimal Randomized Leader Election 奇异最优随机领导人选举

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-06 DOI: 10.4230/LIPIcs.DISC.2020.22

S. Kutten, W. Moses, Gopal Pandurangan, D. Peleg

{"title":"Singularly Optimal Randomized Leader Election","authors":"S. Kutten, W. Moses, Gopal Pandurangan, D. Peleg","doi":"10.4230/LIPIcs.DISC.2020.22","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.22","url":null,"abstract":"This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks. Our main result is a randomized distributed leader election algorithm for asynchronous complete networks that is essentially (up to a polylogarithmic factor) singularly optimal. Our algorithm uses $O(n)$ messages with high probability and runs in $O(log^2 n)$ time (with high probability) to elect a unique leader. The $O(n)$ message complexity should be contrasted with the $Omega(n log n)$ lower bounds for the deterministic message complexity of leader election algorithms (regardless of time), proven by Korach, Moran, and Zaks (TCS, 1989) for asynchronous algorithms and by Afek and Gafni (SIAM J. Comput., 1991) for synchronous networks. Hence, our result also separates the message complexities of randomized and deterministic leader election. More importantly, our (randomized) time complexity of $O(log^2 n)$ for obtaining the optimal $O(n)$ message complexity is significantly smaller than the long-standing $tilde{Theta}(n)$ time complexity obtained by Afek and Gafni and by Singh (SIAM J. Comput., 1997) for message optimal (deterministic) election in asynchronous networks. \u0000In synchronous complete networks, Afek and Gafni showed an essentially singularly optimal deterministic algorithm with $O(log n)$ time and $O(n log n)$ messages. Ramanathan et al. (Distrib. Comput. 2007) used randomization to improve the message complexity, and showed a randomized algorithm with $O(n)$ messages and $O(log n)$ time (with failure probability $O(1 / log^{Omega(1)}n)$). Our second result is a tightly singularly optimal randomized algorithm, with $O(1)$ time and $O(n)$ messages, for this setting, whose time bound holds with certainty and message bound holds with high probability.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"22 1","pages":"22:1-22:18"},"PeriodicalIF":0.0,"publicationDate":"2020-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85582146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Local Conflict Coloring Revisited: Linial for Lists 重新访问局部冲突着色:列表的初始化

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-07-30 DOI: 10.4230/LIPIcs.DISC.2020.16

Yannic Maus, Tigran Tonoyan

{"title":"Local Conflict Coloring Revisited: Linial for Lists","authors":"Yannic Maus, Tigran Tonoyan","doi":"10.4230/LIPIcs.DISC.2020.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.16","url":null,"abstract":"Linial's famous color reduction algorithm reduces a given $m$-coloring of a graph with maximum degree $Delta$ to a $O(Delta^2log m)$-coloring, in a single round in the LOCAL model. We show 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 $Omega(beta^2 (log beta+loglog m + log log |mathcal{C}|))$ from a color space $mathcal{C}$ then they can select a color in two rounds in the LOCAL model. Moreover, the communication of a node essentially consists of sending its list to the neighbors. This is obtained as part of a framework that also contains Linial's color reduction (with an alternative proof) as a special case. Our result also leads to a defective list coloring algorithm. As a corollary, we improve the state-of-the-art truly local $(deg+1)$-list coloring algorithm from Barenboim et al. [PODC'18] by slightly reducing the runtime to $O(sqrt{DeltalogDelta})+log^* n$ and significantly reducing the message size (from huge to roughly $Delta$). Our techniques are inspired by the local conflict coloring framework of Fraigniaud et al. [FOCS'16].","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"514 1","pages":"16:1-16:18"},"PeriodicalIF":0.0,"publicationDate":"2020-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77454877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 27

Time-optimal Loosely-stabilizing Leader Election in Population Protocols 群体协议中时间最优的松散稳定领袖选举

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-05-20 DOI: 10.4230/LIPIcs.DISC.2021.40

Y. Sudo, R. Eguchi, Taisuke Izumi, T. Masuzawa

{"title":"Time-optimal Loosely-stabilizing Leader Election in Population Protocols","authors":"Y. Sudo, R. Eguchi, Taisuke Izumi, T. Masuzawa","doi":"10.4230/LIPIcs.DISC.2021.40","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.40","url":null,"abstract":"We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom. However, the design of self-stabilizing leader election is possible only under a strong assumption (i.e. the knowledge of the emph{exact} size of a network) and rich computational resources (i.e. the number of states). Loose-stabilization, introduced by Sudo et al [Theoretical Computer Science, 2012], is a promising relaxed concept of self-stabilization to address the aforementioned issue. Loose-stabilization guarantees that starting from any configuration, the network will reach a safe configuration where a single leader exists within a short time, and thereafter it will maintain the single leader for a long time, but not forever. The main contribution of the paper is a time-optimal loosely-stabilizing leader election protocol. While the shortest convergence time achieved so far in loosely-stabilizing leader election is $O(log^3 n)$ parallel time, the proposed protocol with design parameter $tau ge 1$ attains $O(tau log n)$ parallel convergence time and $Omega(n^{tau})$ parallel holding time (i.e. the length of the period keeping the unique leader), both in expectation. This protocol is time-optimal in the sense of both the convergence and holding times in expectation because any loosely-stabilizing leader election protocol with the same length of the holding time is known to require $Omega(tau log n)$ parallel time.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"82 19","pages":"40:1-40:17"},"PeriodicalIF":0.0,"publicationDate":"2020-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91405989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots 匿名遗忘机器人在有限可见度的圆上聚集

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-05-16 DOI: 10.4230/LIPIcs.DISC.2020.12

Giuseppe Antonio Di Luna, Ryuhei Uehara, G. Viglietta, Yukiko Yamauchi

{"title":"Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots","authors":"Giuseppe Antonio Di Luna, Ryuhei Uehara, G. Viglietta, Yukiko Yamauchi","doi":"10.4230/LIPIcs.DISC.2020.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.12","url":null,"abstract":"A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial semi-synchronous scheduler (SSYNCH), and an active robot always reaches the destination point it computes (rigidity). Robots have limited visibility: each robot can see only the points on the circle that have an angular distance strictly smaller than a constant $vartheta$ from the robot's current location, where $0<varthetaleqpi$ (angles are expressed in radians). \u0000We study the Gathering problem for such a swarm of robots: that is, all robots are initially in distinct locations on the circle, and their task is to reach the same point on the circle in a finite number of turns, regardless of the way they are activated by the scheduler. Note that, due to the anonymity of the robots, this task is impossible if the initial configuration is rotationally symmetric; hence, we have to make the assumption that the initial configuration be rotationally asymmetric. \u0000We prove that, if $vartheta=pi$ (i.e., each robot can see the entire circle except its antipodal point), there is a distributed algorithm that solves the Gathering problem for swarms of any size. By contrast, we also prove that, if $varthetaleq pi/2$, no distributed algorithm solves the Gathering problem, regardless of the size of the swarm, even under the assumption that the initial configuration is rotationally asymmetric and the visibility graph of the robots is connected. \u0000The latter impossibility result relies on a probabilistic technique based on random perturbations, which is novel in the context of anonymous mobile robots. Such a technique is of independent interest, and immediately applies to other Pattern-Formation problems.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"22 1","pages":"12:1-12:17"},"PeriodicalIF":0.0,"publicationDate":"2020-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89440780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Broadcast CONGEST Algorithms against Adversarial Edges 针对对抗边的广播拥塞算法

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-04-14 DOI: 10.4230/LIPIcs.DISC.2021.23

Yael Hitron, M. Parter

引用次数: 6

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency 简短公告:拜占庭协议，广播和状态机复制具有最佳的良好情况延迟

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-03-29 DOI: 10.4230/LIPIcs.DISC.2020.47

Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang

{"title":"Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency","authors":"Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang","doi":"10.4230/LIPIcs.DISC.2020.47","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.47","url":null,"abstract":"This paper investigates the problem textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach agreement when all non-faulty parties have the same input (or in BB/SMR when the sender/leader is non-faulty) and all messages arrive instantaneously. Previous result implies a lower bound showing that any Byzantine agreement or broadcast protocol tolerating more than $n/3$ faults must have a good-case latency of at least $Delta$ cite{synchotstuff}, where $Delta$ is the assumed maximum message delay. Our first result is a matching tight upper bound for a family of protocols we call $1Delta$. We propose a protocol $1Delta$-BA that solves Byzantine agreement in the synchronous and authenticated setting with optimal good-case latency of $Delta$ and optimal resilience $f<n/2$. We then extend our protocol and present $1Delta$-BB and $1Delta$-SMR for Byzantine fault tolerant broadcast and state machine replication, respectively, in the same setting and with the same optimal good-case latency of $Delta$ and $f<n/2$ fault tolerance. Our $1Delta$-SMR upper bound closes the gap between the best current solution, Sync HotStuff, which obtains a good-case latency of $2Delta$ per command and the lower bound of $Delta$ on good-case latency. Finally, we investigate weaker notions of the synchronous setting and show how to adopt the $1Delta$ approach to these models.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"22 1","pages":"47:1-47:3"},"PeriodicalIF":0.0,"publicationDate":"2020-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73620968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Message complexity of population protocols 人口协议的消息复杂度

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-03-20 DOI: 10.4230/LIPIcs.DISC.2020.6

Talley Amir, J. Aspnes, David Doty, H. MahsaEftekhari, Eric E. Severson

{"title":"Message complexity of population protocols","authors":"Talley Amir, J. Aspnes, David Doty, H. MahsaEftekhari, Eric E. Severson","doi":"10.4230/LIPIcs.DISC.2020.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.6","url":null,"abstract":"The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of the $textit{message complexity}$ for population protocols, where the state of an agent is divided into an externally-visible $textit{message}$ and an internal component, where only the message can be observed by the other agent in an interaction. We consider the case of $O(1)$ message complexity. When time is unrestricted, we obtain an exact characterization of the stably computable predicates based on the number of internal states $s(n)$: If $s(n) = o(n)$ then the protocol computes a semilinear predicate (unlike the original model, which can compute non-semilinear predicates with $s(n) = O(log n)$), and otherwise it computes a predicate decidable by a nondeterministic $O(n log s(n))$-space-bounded Turing machine. We then consider time complexity, introducing novel $O(mathrm{polylog}(n))$ expected time protocols for junta/leader election and general purpose broadcast correct with high probability, and approximate and exact population size counting correct with probability 1. Finally, we show that the main constraint on the power of bounded-message-size protocols is the size of the internal states: with unbounded internal states, any computable function can be computed with probability 1 in the limit by a protocol that uses only one-bit messages.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"6:1-6:18"},"PeriodicalIF":0.0,"publicationDate":"2020-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80031474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7