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

{"title":"Session details: Session 6","authors":"G. Taubenfeld","doi":"10.1145/3252878","DOIUrl":"https://doi.org/10.1145/3252878","url":null,"abstract":"","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"36 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":"121377783","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}

{"title":"Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write","authors":"E. Ruppert","doi":"10.1145/3087801.3087859","DOIUrl":"https://doi.org/10.1145/3087801.3087859","url":null,"abstract":"Implementing stronger read/write registers from weaker ones is a classical problem in the theory of distributed computing. In some such implementations, implemented read operations have the desirable property of not having to write to the base registers used in the implementation. In other cases, it has been proved that implementations cannot have this property. Here, we describe a novel result of the latter type. Although a lock-free implementation of an unbounded register can be built where reads do not write, we show that in any wait-free implementation of unbounded registers from bounded registers, the implemented read operations must write to shared memory.","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":"126714569","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}

{"title":"Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems","authors":"Shankha Chatterjee, W. Golab","doi":"10.1145/3087801.3087850","DOIUrl":"https://doi.org/10.1145/3087801.3087850","url":null,"abstract":"Replication protocols in distributed storage systems are fundamentally constrained by the finite propagation speed of information, which necessitates trade-offs among performance metrics even in the absence of failures. We make two contributions toward a clearer understanding of such trade-offs. First, we introduce a probabilistic model of eventual consistency that captures precisely the relationship between the workload, the network latency, and the consistency observed by clients. Second, we propose a technique for adaptive tuning of the consistency-latency trade-off that is based partly on measurement and partly on mathematical modeling. Experiments demonstrate that our probabilistic model predicts the behavior of a practical storage system accurately for low levels of throughput, and that our tuning framework provides superior convergence compared to a state-of-the-art solution.","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":"129378397","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}

{"title":"Effectiveness of Delaying Timestamp Computation","authors":"S. Kulkarni, N. Vaidya","doi":"10.1145/3087801.3087818","DOIUrl":"https://doi.org/10.1145/3087801.3087818","url":null,"abstract":"Practical algorithms for determining causality by assigning timestamps to events have focused on online algorithms, where a permanent timestamp is assigned to an event as soon as it is created. We address the problem of reducing size of the timestamp by utilizing the underlying topology (which is often not fully connected since not all processes talk to each other) and deferring the assignment of a timestamp to an event for a suitably chosen period of time after the event occurs. Specifically, we focus on inline timestamps, which are a generalization of offline timestamps that are assigned after the computation terminates. We show that for a graph with vertex cover VC, it is possible to assign inline timestamps which contains only 2|VC|+2 elements. By contrast, if online timestamps are desired, then even for a star network, vector timestamp of length n (for the case of integer elements) or n-1 (for the case of real-valued elements) is required. Moreover, in addition to being efficient, the inline timestamps developed can be used to solve typical problems such as predicate detection, replay, recovery that are solved with vector clocks.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"38 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":"121594218","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}

{"title":"Brief Announcement: Distributed Approximation for Tree Augmentation","authors":"K. Censor-Hillel, Michal Dory","doi":"10.1145/3087801.3087842","DOIUrl":"https://doi.org/10.1145/3087801.3087842","url":null,"abstract":"A minimum spanning tree (MST) is an essential structure for distributed algorithms, since it is a low-cost connected subgraph which provides an efficient way to communicate in a network. However, trees cannot survive even one link failure. In this paper, we study the Tree Augmentation Problem (TAP), for which the input is a graph G and a spanning tree T of G and the goal is to augment T with a minimum (or minimum weight) set of edges Aug from G, such that T ∪ Aug remains connected after a failure of any single link. Being central tasks for network design, TAP and additional connectivity augmentation problems have been well studied in the sequential setting. However, despite the distributed nature of these problems, they have not been studied in the distributed setting. We address this fundamental topic and provide a study of distributed TAP. In the full version of this paper, we present distributed 2-approximation algorithms for TAP, both for the unweighted and weighted versions, which have a time complexity of O(h) rounds, where h is the height of T. We also present a distributed 4-approximation for unweighted TAP that has a time complexity of O(√n log*n + D) rounds for a graph G with n vertices and diameter D, which is an improvement for large values of h. We complement our algorithms with lower bounds and some applications to related problems.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"60 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":"117038637","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}

{"title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","authors":"E. Schiller, A. Schwarzmann","doi":"10.1145/3087801","DOIUrl":"https://doi.org/10.1145/3087801","url":null,"abstract":"The ACM Symposium on Principles of Distributed Computing (PODC) is one of the premier international conferences on algorithms for distributed computation, including the theory, design, analysis, implementation, and application of such algorithms to domains stretching from traditional long-haul networks to mobile and sensor networks. PODC is sponsored by the ACM Special Interest Group on theoretical computer science, SIGACT, and the ACM Special Interest Group operating systems, SIGOPS. \u0000 \u0000This volume contains the papers presented at PODC 2017, the 36th Symposium on Principles of Distributed Computing, held on July 25-27, 2017 in Washington, DC. The volume also includes the citations for two awards jointly sponsored by PODC and the EATCS Symposium on Distributed Computing (DISC): the Edsger W. Dijkstra Prize in Distributed Computing, and the Principles of Distributed Computing Doctoral Dissertation Award. \u0000 \u0000The 2017 Edsger W. Dijkstra Prize in Distributed Computing will be presented at DISC 2017 in Vienna, Austria, to Elizabeth Borowsky and Eli Gafni for their paper \"Generalized FLP Impossibility Result for t-resilient Asynchronous Computations\" published in the Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC) in 1993. \u0000 \u0000The 2017 Principles of Distributed Computing Doctoral Dissertation Award is presented to Mohsen Ghaffari, for his dissertation \"Improved Distributed Algorithms for Fundamental Graph Problems,\" written under the supervision of Nancy Lynch at MIT. \u0000 \u0000There were 154 papers submitted to the symposium, and in addition there were 14 brief announcement submissions. The Program Committee selected 38 contributions, or less than 25% of the 154 submissions, for regular presentations at the symposium. Each presentation is accompanied by a ten-page paper in this volume. The Program Committee also selected 21 papers for presentation as brief announcements (some of which came from the regular paper submissions that could not be accepted due to paucity of space). Each brief announcement is accompanied by a three-page paper in this volume. These announcements present ongoing work or recent results, and it is expected that these results will appear as full papers in other conference proceedings or journals. Every submitted paper was read and evaluated by at least three members of the Program Committee. The committee was assisted by more than 140 external reviewers. The Program Committee made its final decisions during the April 24-25, 2017 meeting hosted by Nancy Lynch at MIT. Revised and expanded versions of several selected papers will be considered for publication in a special issue of the journal Distributed Computing and in the Journal of ACM. \u0000 \u0000The program included three keynote lectures by Guy Blelloch (CMU, USA), Maurice Herlihy (Brown University, USA), and Rosario Gennaro (CUNY, USA). \u0000 \u0000The Best Paper Award was presented to Michael Elkin for the paper \"A Simple Deterministic Distributed MST Algorithm, with Near","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"1 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":"129276261","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}

{"title":"Brief Announcement: Secure Self-Stabilizing Computation","authors":"S. Dolev, Karim M. El Defrawy, J. Garay, Muni Venkateswarlu Kumaramangalam, R. Ostrovsky, M. Yung","doi":"10.1145/3087801.3087864","DOIUrl":"https://doi.org/10.1145/3087801.3087864","url":null,"abstract":"Self-stabilization refers to the ability of systems to recover after temporal violations of conditions required for their correct operation. Such violations may lead the system to an arbitrary state from which it should automatically recover. Today, beyond recovering functionality, there is a need to recover security and confidentiality guarantees as well. To the best of our knowledge, there are currently no self-stabilizing protocols that also ensure recovering confidentiality, authenticity, and integrity properties. Specifically, self-stabilizing systems are designed to regain functionality which is, roughly speaking, desired input output relation, ignoring the security and confidentiality of computation and its state. Distributed (cryptographic) protocols for generic secure and privacy-preserving computation, e.g., secure Multi-Party Computation (MPC), usually ensure secrecy of inputs and outputs, and correctness of computation when the adversary is limited to compromise only a fraction of the components in the system, e.g., the computation is secure only in the presence of an honest majority of involved parties. While there are MPC protocols that are secure against a dishonest majority, in reality, the adversary may compromise all components of the system for a while; some of the corrupted components may then recover, e.g., due to security patches and software updates, or periodical code refresh and local state consistency check and enforcement based on self-stabilizing hardware and software techniques. It is currently unclear if a system and its state can be designed to always fully recover following such individual asynchronous recoveries. This paper introduces Secure Self-stabilizing Computation which answers this question in the affirmative. Secure self-stabilizing computation design ensures that secrecy of inputs and outputs, and correctness of the computation are automatically regained, even if at some point the entire system is compromised. We consider the distributed computation task as the implementation of virtual global finite satiate machine (FSM) to present commonly realized computation. The FSM is designed to regain consistency and security in the presence of a minority of Byzantine participants, e.g., one third of the parties, and following a temporary corruption of the entire system. We use this task and settings to demonstrate the definition of secure self-stabilizing computation. We show how our algorithms and system autonomously restore security and confidentiality of the computation of the FSM once the required corruption thresholds are again respected.","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":"131567116","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}

{"title":"Session details: Session 9","authors":"A. Schwarzmann","doi":"10.1145/3252881","DOIUrl":"https://doi.org/10.1145/3252881","url":null,"abstract":"","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"10 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":"117025058","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}

{"title":"Brief Announcement: Hierarchical Consensus","authors":"Benjamin Bengfort, P. Keleher","doi":"10.1145/3087801.3087853","DOIUrl":"https://doi.org/10.1145/3087801.3087853","url":null,"abstract":"We introduce Hierarchical Consensus, an approach to generalizing consensus that allows us to scale groups beyond a handful of nodes, across wide areas. Hierarchical Consensus increases the availability of consensus groups by partitioning the decision space and nominating distinct leaders for each partition. Partitions eliminate distance by allowing decision-making to be co-located with replicas that are responding to accesses. A root quorum guarantees global consistency and fault tolerance. Hierarchical consensus is flexible locally, but improves upon prior approaches by balancing load, allowing fast replication across wide areas, and enabling consensus across large (> 100) systems of devices.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"559 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":"123130791","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}

{"title":"Recoverable Mutual Exclusion in Sub-logarithmic Time","authors":"W. Golab, Danny Hendler","doi":"10.1145/3087801.3087819","DOIUrl":"https://doi.org/10.1145/3087801.3087819","url":null,"abstract":"Recoverable mutual exclusion (RME) is a variation on the classic mutual exclusion (ME) problem that allows processes to crash and recover. The time complexity of RME algorithms is quantified in the same way as for ME, namely by counting remote memory references -- expensive memory operations that traverse the processor-to-memory interconnect. Prior work on the RME problem established an upper bound of O(log N) RMRs in an asynchronous shared memory model with N processes that communicate using atomic read and write operations, prompting the question whether sub-logarithmic RMR complexity is attainable using common read-modify-write primitives. We answer this question positively in the cache-coherent model by presenting an RME algorithm that incurs O(log N / log log N) RMRs and uses read, write, Fetch-And-Store, and Compare-And-Swap instructions. We also present an O(1) RMRs algorithm that relies on double-word Compare-And-Swap and a double-word variation of Fetch-And-Store. Both algorithms are inspired by Mellor-Crummey and Scott's queue lock.","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":"126861376","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}