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

A certain freedom: thoughts on the CAP theorem 一定的自由:关于CAP定理的思考

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

E. Brewer

{"title":"A certain freedom: thoughts on the CAP theorem","authors":"E. Brewer","doi":"10.1145/1835698.1835701","DOIUrl":"https://doi.org/10.1145/1835698.1835701","url":null,"abstract":"At PODC 2000, the CAP theorem received its first broad audience. Surprisingly for an impossibility result, one important effect has been to free designers to explore a wider range of distributed systems. Designers of wide-area systems, in which network partitions are considered inevitable, know they cannot have both availability and consistency, and thus can now justify weaker consistency. The rise of the \"NoSQL\" movement (\"Not Only SQL\") is an expression of this freedom. The choices of how and when to weaken consistency are often the defining characteristics of these systems, with new variations appearing every year. We review a variety of interesting places in the \"CAP Space\" as a way to illuminate these issues and their consequences. For example, automatic teller machines (ATMs), which predate the CAP theorem, surprisingly choose availability with weak consistency but with bounded risk. Finally, I explore a few of the options to try to \"work around\" the impossible. The most basic is the use of commutative operations, which make it easy to restore consistency after a partition heals. However, even many commutative operations have non-commutative exceptions in practice, which means that the exceptions may be incorrect or late. Adding the concept of \"delayed exceptions\" allows more operations to be considered commutative and simplifies eventual consistency during a partition. Furthermore, we can think of delayed exception handling as \"compensation\" - we execute a compensating transaction that restores consistency. Delayed exception handling with compensation appears to be what most real wide-area systems do - inconsistency due to limited communication is treated as an exception and some exceptional action, such as monetary compensation or even legal action, is used to fix it. This approach to wide-area systems puts the emphasis on audit trails and recovery rather than prevention, and implies that we should expand and formalize the role of compensation in the design of complex systems","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"54 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":"130512241","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}

引用次数: 90

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/3258216

Antonio Fernandez Anta

引用次数: 0

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/3258210

Seth Gilbert

引用次数: 0

The multiplicative power of consensus numbers 共识数的乘法能力

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

Damien Imbs, M. Raynal

{"title":"The multiplicative power of consensus numbers","authors":"Damien Imbs, M. Raynal","doi":"10.1145/1835698.1835705","DOIUrl":"https://doi.org/10.1145/1835698.1835705","url":null,"abstract":"The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom. Said in another way, the BG simulation shows that the crucial parameter is not the number n of processes but the upper bound t on the number of processes that are allowed to crash. The BG algorithm considers colorless decision tasks in the base read/write shared memory model. (Colorless means that if, process decides a value, any other process is allowed to decide the very same value.) This paper considers system models made up of n processes prone to up to t crashes, and where the processes communicate by accessing read/write atomic registers (as assumed by the BG) and (differently from the BG) objects with consensus number x accessible by at most x processes (with x ≤ t < n). Let ASM(n,t,x) denote such a system model. While the BG simulation has shown that the models ASM(n,t,1) and ASM(t+1,t,1) are equivalent, this paper focuses the pair (t,x) of parameters of a system model. Its main result is the following: the system models ASM (n1,t1,x1) and ASM (n2,t2,x2) have the same computational power for colorless decision tasks if and only if ⌊t1⁄x1⌋ = ⌊t1⁄x1⌋. As can be seen, this contribution complements and extends the BG simulation. It shows that consensus numbers have a multiplicative power with respect to failures, namely the system models ASM(n,t',x) and ASM(n,t,1) are equivalent for colorless decision tasks iff (t x x) ≤ t' ≤ (t x x)+(x-1).","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"33 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":"131849806","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}

引用次数: 21

Brief announcement: network traffic can optimize consolidation during transformation to virtualization 简要公告:网络流量在虚拟化转型过程中可以优化整合

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

Kewei Sun, Ying Li, Jing Luo

引用次数: 0

Brief announcement: distributed almost stable marriage 简短公告:分布几乎稳定的婚姻

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

P. Floréen, P. Kaski, V. Polishchuk, J. Suomela

引用次数: 1

Brief announcement: modelling MapReduce for optimal execution in the cloud 简短声明:在云中建模MapReduce以获得最佳执行

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

Alexander Wieder, Pramod Bhatotia, Ansley Post, R. Rodrigues

引用次数: 56

Distributed data classification in sensor networks 传感器网络中的分布式数据分类

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

Ittay Eyal, I. Keidar, R. Rom

{"title":"Distributed data classification in sensor networks","authors":"Ittay Eyal, I. Keidar, R. Rom","doi":"10.1145/1835698.1835738","DOIUrl":"https://doi.org/10.1145/1835698.1835738","url":null,"abstract":"Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., a local sensor read, and a concise picture of the global system state needs to be obtained. In resource-constrained environments like sensor networks, this needs to be done without collecting all the data at any location, i.e., in a distributed, manner. To this end, we define the distributed classification problem, in which numerous interconnected nodes compute a classification of their data, i.e., partition these values into multiple collections, and describe each collection concisely. We present a generic algorithm that solves the distributed classification problem and may be implemented in various topologies, using different classification types. For example, the generic algorithm can be instantiated to classify values according to distance, like the famous k-means classification algorithm. However, the distance criterion is often not sufficient to provide good classification results. We present an instantiation of the generic algorithm that describes the values as a Gaussian Mixture (a set of weighted normal distributions), and uses machine learning tools for classification decisions. Simulations show the robustness and speed of this algorithm. We prove that any implementation of the generic algorithm converges over any connected topology, classification criterion and collection representation, in fully asynchronous settings.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"152 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":"124179867","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

Brief announcement: distributed contention resolution in wireless networks 简短公告:无线网络中的分布式争用解决方案

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

Thomas Kesselheim, Berthold Vöcking

{"title":"Brief announcement: distributed contention resolution in wireless networks","authors":"Thomas Kesselheim, Berthold Vöcking","doi":"10.1145/1835698.1835731","DOIUrl":"https://doi.org/10.1145/1835698.1835731","url":null,"abstract":"We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric space. Each sender wants to transmit a signal to its receiver at a prespecified power level, e.g., all senders use the same, uniform power level as it is typically implemented in practice. Our analysis is based on the physical model in which the success of a transmission depends on the Signal-to-Interference-plus-Noise-Ratio (SINR). The objective is to minimize the number of time slots until all signals are successfully transmitted. Our main technical contribution is the introduction of a measure called maximum average affectance enabling us to analyze random contention-resolution algorithms in which each packet is transmitted in each step with a fixed probability depending on the maximum average affectance. We prove that the schedule generated this way is only an O(log2 n) factor longer than the optimal one, provided that the prespecified power levels satisfy natural monontonicity properties. By modifying the algorithm, senders need not to know the maximum average affectance in advance but only static information about the network. In addition, we extend our approach to multi-hop communication achieving the same appoximation factor.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"356 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":"124201188","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: the price of anarchy for distributed network formation in an adversary model 简短声明:在对手模型中分布式网络形成的无政府状态的代价

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

Lasse Kliemann

引用次数: 5