Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing最新文献_第7页

Rapid randomized pruning for fast greedy distributed algorithms 快速贪婪分布式算法的快速随机剪枝

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835777

Saurav Pandit, S. Pemmaraju

{"title":"Rapid randomized pruning for fast greedy distributed algorithms","authors":"Saurav Pandit, S. Pemmaraju","doi":"10.1145/1835698.1835777","DOIUrl":"https://doi.org/10.1145/1835698.1835777","url":null,"abstract":"We start by defining a pruning process involving sellers on one side and buyers on the other. The goal is to quickly select a subset of the sellers so that the products that these sellers bring to the market has small cost ratio, i.e., the ratio of the total cost of the selected sellers' products to amount that interested buyers are willing to pay. As modeled here, the pruning process can be used to speed up distributed implementations of greedy algorithms (e.g., for minimum dominating set, facility location, etc). We present a randomized instance of the pruning process that, for any positive k, runs in O(k) communication rounds with O(log N)-sized messages, yielding a cost ratio of O(Nc/k). Here N is the product of the number of sellers and number of buyers and c is a small constant. Using this O(k)-round pruning algorithm as the basis, we derive several simple, greedy, O(k)-round distributed approximation algorithms for MDS and facility location (both metric and non-metric versions). Our algorithms achieve optimal approximation ratios in polylogarithmic rounds and shave a \"logarithmic factor\" off the best, known, approximation factor, typically achieved using LP-rounding techniques.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359125","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}

引用次数: 10

Brief announcement: distributed trust management and revocation 简短公告:分布式信任管理和撤销

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835751

Dmitriy Kuptsov, A. Gurtov, Óscar García-Morchón, Klaus Wehrle

{"title":"Brief announcement: distributed trust management and revocation","authors":"Dmitriy Kuptsov, A. Gurtov, Óscar García-Morchón, Klaus Wehrle","doi":"10.1145/1835698.1835751","DOIUrl":"https://doi.org/10.1145/1835698.1835751","url":null,"abstract":"Fair node and network operation is a key to ensure the correct system operation. The problem arises when some nodes become compromised or faulty endangering the overall system. This is especially challenging in sensor networks because they are often deployed in hostile environments and have to endure both passive and active attacks. Therefore, a node should only communicate with trusted nodes, while non-trusted nodes should be removed from the system to prevent them from further disrupting its normal operation. To address such threats, we introduce the Efficient Cooperative Security (ECoSec) - a distributed and adaptive protocol that allows a network to control the admission and revocation of nodes in a cooperative and democratic way during two voting rounds. Whereas the contributions of the protocol to the family of cooperative security protocols are two fold. First, it introduces the use of polynomial-based votes showing that its operation, and in general, operation of cooperative security protocols, can endure up to 33% of misbehaving nodes. Second, the protocol applies correlated keying material structures to verify the node admission and node revocation voting procedures reducing the overall communication overhead.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115906697","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}

引用次数: 5

Brief announcement: sources of instability in data center multicast 简短公告:数据中心多播不稳定的来源

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835732

Dmitry Basin, K. Birman, I. Keidar, Ymir Vigfusson

引用次数: 3

Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates 简要公告:基于虚拟几何坐标的多播树嵌入P2P覆盖网络的分散构造

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835766

M. Andreica, Andrei Dragus, A. Sambotin, N. Tapus

引用次数: 4

Brief announcement: single-version permissive STM 简短声明:单版本允许的STM

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835712

H. Attiya, Eshcar Hillel

引用次数: 1

On the theoretical gap between synchronous and asynchronous MPC protocols 论同步与异步MPC协议的理论差异

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835746

Zuzana Beerliová-Trubíniová, M. Hirt, J. Nielsen

{"title":"On the theoretical gap between synchronous and asynchronous MPC protocols","authors":"Zuzana Beerliová-Trubíniová, M. Hirt, J. Nielsen","doi":"10.1145/1835698.1835746","DOIUrl":"https://doi.org/10.1145/1835698.1835746","url":null,"abstract":"Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if t < n/2, when the channels are synchronous, and t < n/3, when the channels are asynchronous, respectively. In this work we analyze the gap between these bounds, and show that in the cryptographic setting (with setup), the sole reason for it is the distribution of inputs: given an oracle for input distribution, cryptographically-secure asynchronous MPC is possible with the very same condition as synchronous MPC, namely t < n/2. We do not know whether the gaps in other security models (perfect, statistical) have the same cause. We stress that all previous asynchronous MPC protocols inherently require t < n/3, even once inputs are distributed. In particular, all published asynchronous multiplication sub-protocols inherently require t < n/3 and cannot be used in our setting. Furthermore, we show that such an input-distribution oracle can be reduced to an oracle that allows each party to synchronously broadcast one single message. This means that when one single round of synchronous broadcast is available, then asynchronous MPC is possible at the same condition as synchronous MPC, namely t < n/2. If such a round cannot be used, then MPC (and even Byzantine agreement) requires t < n/3.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122060005","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}

引用次数: 17

Adaptive randomized mutual exclusion in sub-logarithmic expected time 次对数期望时间下的自适应随机互斥

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835737

Danny Hendler, Philipp Woelfel

{"title":"Adaptive randomized mutual exclusion in sub-logarithmic expected time","authors":"Danny Hendler, Philipp Woelfel","doi":"10.1145/1835698.1835737","DOIUrl":"https://doi.org/10.1145/1835698.1835737","url":null,"abstract":"Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. A mutual exclusion algorithm is adaptive to point contention, if its RMR complexity is a function of the maximum number of processes concurrently executing their entry, critical, or exit section. In the best prior art deterministic adaptive mutual exclusion algorithm, presented by Kim and Anderson [22], a process performs O(min(k,log N)) RMRs as it enters and exits its critical section, where k is point contention and N is the number of processes in the system. Kim and Anderson also proved that a deterministic algorithm with o(k) RMR complexity does not exist [21]. However, they describe a randomized mutual exclusion algorithm that has O(log k) expected RMR complexity against an oblivious adversary. All these results apply for algorithms that use only atomic read and write operations. We present a randomized adaptive mutual exclusion algorithms with O(log k/loglog k) expected amortized RMR complexity, even against a strong adversary, for the cache-coherent shared memory read/write model. Using techniques similar to those used in [17], our algorithm can be adapted for the distributed shared memory read/write model. This establishes that sub-logarithmic adaptive mutual exclusion, using reads and writes only, is possible.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121459923","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}

引用次数: 18

Brief announcement: a framework for building self-stabilizing overlay networks 简要公告:构建自稳定覆盖网络的框架

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835790

Andrew Berns, Sukumar Ghosh, S. Pemmaraju

引用次数: 9

Session details: Regular papers 会议细节:常规论文

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/3258207

E. Rupert

引用次数: 0

Verifying linearizability with hindsight 事后验证线性化

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835722

P. O'Hearn, N. Rinetzky, Martin T. Vechev, Eran Yahav, G. Yorsh

引用次数: 72