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

Session details: Brief announcements 会议详情:简短公告

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

M. Aguilera

引用次数: 0

Brief announcement: revisiting the power-law degree distribution for social graph analysis 简短公告:重新审视幂律度分布的社会图谱分析

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

A. Sala, Haitao Zheng, Ben Y. Zhao, S. Gaito, G. P. Rossi

引用次数: 39

Partial information spreading with application to distributed maximum coverage 部分信息随着应用传播到分布的最大覆盖范围

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

K. Censor-Hillel, H. Shachnai

{"title":"Partial information spreading with application to distributed maximum coverage","authors":"K. Censor-Hillel, H. Shachnai","doi":"10.1145/1835698.1835739","DOIUrl":"https://doi.org/10.1145/1835698.1835739","url":null,"abstract":"This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received by all nodes, we propose a relaxed requirement, where only n/c nodes need to receive each message, and every node should receive n/c messages, for some c ≥ 1. As a key tool in our study we introduce the novel concept of weak conductance, a generalization of classic graph conductance which allows to analyze the time required for partial information spreading. We show the power of weak conductance as a measure of how well-knit the components of a graph are, by giving an example of a graph family for which the conductance is O(n-2), while the weak conductance is as large as 1/2. For such graphs, weak conductance can be used to show that partial information spreading requires time complexity of O(logn). Finally, we demonstrate the usefulness of partial information spreading in solving the maximum coverage problem, which naturally arises in circuit layout, job scheduling and facility location, as well as in distributed resource allocation with a global budget constraint. Our algorithm yields a constant approximation factor and a constant deviation from the given budget. For graphs with a constant weak conductance, this implies a scalable time complexity for solving a problem with a global constraint.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"6 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":"115180501","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}

引用次数: 35

Brief announcement: improving social-network-based sybil-resilient node admission control 简短声明:改进基于社交网络的抗sybil节点准入控制

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

Dinh Nguyen Tran, Jinyang Li, L. Subramanian, Sherman S. M. Chow

引用次数: 9

Session details: Brief announcements 会议详情:简短公告

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

Luís Rodrigues

引用次数: 0

Brief announcement: anonymity and trust in distributed systems 简短声明:分布式系统中的匿名和信任

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

M. Backes, Stefan Lorenz, Matteo Maffei, Kim Pecina

引用次数: 1

Brief announcement: on L-resilience, hitting sets, and colorless tasks 简短声明:关于左旋弹性，击球集和无颜色任务

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

E. Gafni, P. Kuznetsov

{"title":"Brief announcement: on L-resilience, hitting sets, and colorless tasks","authors":"E. Gafni, P. Kuznetsov","doi":"10.1145/1835698.1835719","DOIUrl":"https://doi.org/10.1145/1835698.1835719","url":null,"abstract":"The condition of t-resilience stipulates that an n-process program is only obliged to make progress when at least n-t processes are correct. Put another way, the live sets, the collection of process sets such that progress is guaranteed if at least one of the sets is correct, are all sets with at least n-t processes. Given an arbitrary collection of live sets L, what distributed tasks are solvable? We show that the power of L to solve tasks is tightly related to the L, minimum hitting set, of L, a minimum cardinality subset of processes that has a non-empty intersection with every live set. A necessary condition to make progress in the presence of L is that at least one member of the set is correct. Thus, finding the computing power of L, is NP-complete. For the special case of colorless, tasks that allow every process to adopt an input or output value of any other process, we show that the set of tasks that an L-resilient adversary can solve is exactly captured by the size of its minimum hitting set. For general tasks, we characterize L-resilient solvability of tasks with respect to a limited notion of weak solvability (which is however stronger than colorless solvability). Given a task T, we construct another task T' such that T is solvable weakly L-resiliently if and only if T' is solvable weakly wait-free.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"6 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":"130194278","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

The topology of shared-memory adversaries 共享内存对手的拓扑结构

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

M. Herlihy, S. Rajsbaum

引用次数: 43

On utilizing speed in networks of mobile agents 浅谈移动代理网络中速度的利用

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

J. Beauquier, J. Burman, J. Clément, S. Kutten

{"title":"On utilizing speed in networks of mobile agents","authors":"J. Beauquier, J. Burman, J. Clément, S. Kutten","doi":"10.1145/1835698.1835775","DOIUrl":"https://doi.org/10.1145/1835698.1835775","url":null,"abstract":"Population protocols are a model presented recently for networks with a very large, possibly unknown number of mobile agents having small memory. This model has certain advantages over alternative models (such as DTN) for such networks. However, it was shown that the computational power of this model is limited to semi-linear predicates only. Hence, various extensions were suggested. We present a model that enhances the original model of population protocols by introducing a (weak) notion of speed of the agents. This enhancement allows us to design fast converging protocols with only weak requirements (for example, suppose that there are different types of agents, say agents attached to sick animals and to healthy animals, two meeting agents just need to be able to estimate which of them is faster, e.g., using their types, but not to actually know the speeds of their types). Then, using the new model, we study the gathering problem, in which there is an unknown number of anonymous agents that have values they should deliver to a base station (without replications). We develop efficient protocols step by step searching for an optimal solution and adapting to the size of the available memory. The protocols are simple, though their analysis is somewhat involved. We also present a more involved result - a lower bound on the length of the worst execution for any protocol. Our proofs introduce several techniques that may prove useful also in future studies of time in population protocols.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"1 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":"127454786","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}

引用次数: 31

Brief announcement: monotonic stabilization 简短公告:单调稳定

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

Yukiko Yamauchi, S. Tixeuil

引用次数: 1