Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing最新文献_第6页

An Asynchronous Computability Theorem for Fair Adversaries 公平对手的异步可计算性定理

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212765

P. Kuznetsov, Thibault Rieutord, Yuan He

引用次数: 16

Data Summarization and Distributed Computation 数据汇总与分布式计算

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212795

Graham Cormode

引用次数: 1

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs 最小k边连通生成子图的分布逼近

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-05-20 DOI: 10.1145/3212734.3212760

Michal Dory

引用次数: 14

Fair Leader Election for Rational Agents in Asynchronous Rings and Networks 异步环和网络中理性代理的公平领导选举

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-05-12 DOI: 10.1145/3212734.3212767

A. Yifrach, Y. Mansour

{"title":"Fair Leader Election for Rational Agents in Asynchronous Rings and Networks","authors":"A. Yifrach, Y. Mansour","doi":"10.1145/3212734.3212767","DOIUrl":"https://doi.org/10.1145/3212734.3212767","url":null,"abstract":"We study a game theoretic model where a coalition of processors might collude to bias the outcome of the protocol, where we assume that the processors always prefer any legitimate outcome over a non-legitimate one. We show that the problems of Fair Leader Election and Fair Coin Toss are equivalent, and focus on Fair Leader Election. Our main focus is on a directed asynchronous ring of n processors, where we investigate the protocol proposed by Abraham et al. [4] and studied in Afek et al. [5]. We show that in general the protocol is resilient only to sub-linear size coalitions. Specifically, we show that Ω( p n logn) randomly located processors or Ω( 3 √ n) adversarially located processors can force any outcome. We complement this by showing that the protocol is resilient to any adversarial coalition of size O( 4 √ n). We propose a modification to the protocol, and show that it is resilient to every coalition of size ?( √ n), by exhibiting both an attack and a resilience result. For every k ≥ 1, we define a family of graphs Gk that can be simulated by trees where each node in the tree simulates at most k processors. We show that for every graph in Gk , there is no fair leader election protocol that is resilient to coalitions of size k. Our result generalizes a previous result of Abraham et al. [4] that states that for every graph, there is no fair leader election protocol which is resilient to coalitions of size ?n/2 ?.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123019695","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}

引用次数: 12

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds Õ(n 3/2)轮中精确加权全对最短路径的确定性分布算法

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-04-15 DOI: 10.1145/3212734.3212773

U. Agarwal, V. Ramachandran, Valerie King, Matteo Pontecorvi

引用次数: 38

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks CONGEST网络中直径的亚线性时间量子计算

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-04-09 DOI: 10.1145/3212734.3212744

F. Gall, F. Magniez

引用次数: 29

The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory 异步共享内存中随机梯度下降的收敛性

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-03-23 DOI: 10.1145/3212734.3212763

Dan Alistarh, Christopher De Sa, Nikola Konstantinov

{"title":"The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory","authors":"Dan Alistarh, Christopher De Sa, Nikola Konstantinov","doi":"10.1145/3212734.3212763","DOIUrl":"https://doi.org/10.1145/3212734.3212763","url":null,"abstract":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321806","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}

引用次数: 41

Improved Distributed Delta-Coloring 改进的分布式delta着色

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-03-08 DOI: 10.1145/3212734.3212764

M. Ghaffari, J. Hirvonen, F. Kuhn, Yannic Maus

引用次数: 26

Population Stability: Regulating Size in the Presence of an Adversary 人口稳定性:在对手存在的情况下调节人口规模

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-03-07 DOI: 10.1145/3212734.3212747

S. Goldwasser, R. Ostrovsky, Alessandra Scafuro, Adam Sealfon

{"title":"Population Stability: Regulating Size in the Presence of an Adversary","authors":"S. Goldwasser, R. Ostrovsky, Alessandra Scafuro, Adam Sealfon","doi":"10.1145/3212734.3212747","DOIUrl":"https://doi.org/10.1145/3212734.3212747","url":null,"abstract":"We introduce a new coordination problem in distributed computing that we call the population stability problem. A system of agents each with limited memory and communication, as well as the ability to replicate and self-destruct, is subjected to attacks by a worst-case adversary that can at a bounded rate (1) delete agents chosen arbitrarily and (2) insert additional agents with arbitrary initial state into the system. The goal is perpetually to maintain a population whose size is within a constant factor of the target size N. The problem is inspired by the ability of complex biological systems composed of a multitude of memory-limited individual cells to maintain a stable population size in an adverse environment. Such biological mechanisms allow organisms to heal after trauma or to recover from excessive cell proliferation caused by inflammation, disease, or normal development. We present a population stability protocol in a communication model that is a synchronous variant of the population model of Angluin et al. In each round, pairs of agents selected at random meet and exchange messages, where at least a constant fraction of agents is matched in each round. Our protocol uses three-bit messages and ω(log^2 N) states per agent. We emphasize that our protocol can handle an adversary that can both insert and delete agents, a setting in which existing approximate counting techniques do not seem to apply. The protocol relies on a novel coloring strategy in which the population size is encoded in the variance of the distribution of colors. Individual agents can locally obtain a weak estimate of the population size by sampling from the distribution, and make individual decisions that robustly maintain a stable global population size.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128018485","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

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover 改进的MIS，匹配和顶点覆盖的大规模并行计算算法

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-02-22 DOI: 10.1145/3212734.3212743

M. Ghaffari, Themis Gouleakis, Slobodan Mitrovic, R. Rubinfeld

引用次数: 117