Proceedings of the ACM Symposium on Principles of Distributed Computing最新文献

Distributed Approximation of Maximum Independent Set and Maximum Matching 最大独立集的分布逼近与最大匹配

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087806

R. Bar-Yehuda, K. Censor-Hillel, M. Ghaffari, Gregory Schwartzman

{"title":"Distributed Approximation of Maximum Independent Set and Maximum Matching","authors":"R. Bar-Yehuda, K. Censor-Hillel, M. Ghaffari, Gregory Schwartzman","doi":"10.1145/3087801.3087806","DOIUrl":"https://doi.org/10.1145/3087801.3087806","url":null,"abstract":"We present a simple distributed Δ-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS ⋅ log W) rounds, where Δ is the maximum degree, MIS is the number of rounds needed to compute a maximal independent set (MIS) on G, and W is the maximum weight of a node. Plugging in the best known algorithm for MIS gives a randomized solution in O(log n log W) rounds, where n is the number of nodes. We also present a deterministic O(Δ +log* n)-round algorithm based on coloring. We then show how to use our MaxIS approximation algorithms to compute a 2-approximation for maximum weight matching without incurring any additional round penalty in the CONGEST model. We use a known reduction for simulating algorithms on the line graph while incurring congestion, but we show our algorithm is part of a broad family of local aggregation algorithms for which we describe a mechanism that allows the simulation to run in the CONGEST model without an additional overhead. Next, we show that for maximum weight matching, relaxing the approximation factor to (2+ε) allows us to devise a distributed algorithm requiring O((log Δ)/(log logΔ)) rounds for any constant ε>0. For the unweighted case, we can even obtain a (1+ε)-approximation in this number of rounds. These algorithms are the first to achieve the provably optimal round complexity with respect to dependency on Δ.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116926874","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}

引用次数: 46

The Space Requirement of Local Forwarding on Acyclic Networks 无环网络中本地转发的空间需求

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087803

B. Patt-Shamir, Will Rosenbaum

{"title":"The Space Requirement of Local Forwarding on Acyclic Networks","authors":"B. Patt-Shamir, Will Rosenbaum","doi":"10.1145/3087801.3087803","DOIUrl":"https://doi.org/10.1145/3087801.3087803","url":null,"abstract":"We consider packet forwarding in acyclic networks with bounded adversarial packet injections. We focus on the model of adversarial queuing theory, where each packet is injected into the network with a prescribed path to its destination, and both the long-range average rate and the short-range burst size are bounded. Each edge has an associated buffer that stores packets while they wait to cross the edge. Our goal is to minimize the buffer space required to avoid overflows. Previous results for local forwarding protocols required buffers of size Omega(n). In the case of single destination trees, it is known that for centralized protocols, buffers of size O(1) are sufficient. We show that for local protocols, buffers of size Theta(log n) are necessary and sufficient for single destination trees. The upper bound is achieved by a novel protocol which we call Odd-Even Downhill forwarding (OED). We also show that even slightly more general networks---such as path graphs with multiple destinations, or DAGs with a single destination---require buffers of size Omega(n) to avoid overflows, even if forwarding is done by centralized, offline protocols.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310031","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}

引用次数: 6

Brief Announcement: Fence Insertion for Straight-line Programs is in P 简短公告:直线程序的围栏插入在P

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087849

M. Lesani

引用次数: 2

Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination 简短公告:最佳地址遗忘流行病传播

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087862

H. Mercier, Laurent Hayez, M. Matos

{"title":"Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination","authors":"H. Mercier, Laurent Hayez, M. Matos","doi":"10.1145/3087801.3087862","DOIUrl":"https://doi.org/10.1145/3087801.3087862","url":null,"abstract":"We consider the problem of reliable gossip/epidemic dissemination in a network of n processes using push and pull algorithms. We generalize the random phone call model so that processes can refuse to push a rumor or answer pull requests. With this relaxation, we show that it is possible to disseminate a rumor to all processes with high probability using Theta(ln n) rounds of communication and only n+O(n / ln n) messages, both of which are optimal and achievable with push-pull and pull-only algorithms. Our algorithms are strikingly simple, address-oblivious and thus fully distributed. This contradicts a well-known result of Karp et al. stating that any address-oblivious algorithm requires Omega(n ln ln n) messages. We also develop precise estimates of the number of rounds required in the push and pull phases of our algorithms to guarantee dissemination to all processes with a certain probability. For the push phase, we focus on a practical infect upon contagion approach that balances the load evenly across all processes. As an example, our push-pull algorithm requires 17 rounds to disseminate a rumor to all processes with probability 1 - 10^-100 in a network of one million processes with a communication overhead of only 0.4%.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129577197","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}

引用次数: 1

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks 简要公告:任意网络的高效自稳定1-极大匹配算法

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087840

M. Inoue, Fukuhito Ooshita, S. Tixeuil

引用次数: 5

Brief Announcement: How Large is your Graph? 简短公告:你的图表有多大?

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087855

Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo

引用次数: 0

Analyzing Contention and Backoff in Asynchronous Shared Memory 异步共享内存中的争用和回退分析

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087828

N. Ben-David, G. Blelloch

{"title":"Analyzing Contention and Backoff in Asynchronous Shared Memory","authors":"N. Ben-David, G. Blelloch","doi":"10.1145/3087801.3087828","DOIUrl":"https://doi.org/10.1145/3087801.3087828","url":null,"abstract":"Randomized backoff protocols have long been used to reduce contention on shared resources. They are heavily used in communication channels and radio networks, and have also been shown to greatly improve the performance of shared memory algorithms in real systems.However, while backoff protocols are well understood in many settings, their effect in shared memory has never been theoretically analyzed. This discrepency may be due to the difficulty of modeling asynchrony without eliminating the advantage gained by local delays. In this paper, we introduce a new cost model for contention in shared memory. Our model allows for adversarial asynchrony, but also provides a clear notion of time, thus enabling easy calculation of contention costs and delays. We then consider a simple use case in which n processes try to update a single memory location. Using our model, we first show that a naive protocol, without any backoff, requires Omega(n^3) work until all processes successfully update that location. We then analyze the commonly used exponential delay protocol, and show that it requires Theta(n^2 log n) work with high probability. Finally, we show that the exponential delay protocol is suboptimal, by introducing a new backoff protocol based on adaptive probabilities and showing that, for the same use case, it requires only O(n^2) work with high probability.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116814262","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

Verifiable Outsourced Computation: A Survey 可验证外包计算:一项调查

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087872

R. Gennaro

引用次数: 6

Session details: Session 1 会话详细信息:会话1

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3252873

J. Welch

引用次数: 0

Blockchains and the Future of Distributed Computing 区块链和分布式计算的未来

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087873

M. Herlihy

引用次数: 19