Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing最新文献_第2页

Session details: Session 1A: Persistent Memory 会话详细信息:会话1A: Persistent Memory

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258695

I. Keidar

引用次数: 0

Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage 简短公告:图形探索使用恒定大小的内存和存储

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212780

Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi

引用次数: 0

Session details: Session 1C: Wireless Networks 会议详情:会议1C:无线网络

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258697

J. Burman

引用次数: 0

Session details: Session 2C: Security, Blockchains, and Replication 会话详细信息:会话2C:安全性，区块链和复制

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258701

G. Chockler

引用次数: 0

Session details: Session 1D: Graph Algorithms 会话详细信息:会话1D: Graph Algorithms

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258698

Peter Robinson

引用次数: 0

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms 放松调度可以有效地并行化迭代算法

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212756

Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze

{"title":"Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms","authors":"Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze","doi":"10.1145/3212734.3212756","DOIUrl":"https://doi.org/10.1145/3212734.3212756","url":null,"abstract":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127983905","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

Brief Announcement: Performance Prediction for Coarse-Grained Locking 简要公告:粗粒度锁的性能预测

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212785

V. Aksenov, Dan Alistarh, P. Kuznetsov

引用次数: 5

Session details: Session 3D: Graphs and Population 会议详情:会议3D:图表和人口

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258705

Michael Elkin

引用次数: 0

From Self-Stabilization to Self-Optimization: Principles of Distributed Network Design 从自稳定到自优化:分布式网络设计原理

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212801

S. Schmid

引用次数: 1

Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed Services 简要公告:MUSIC:地理分布式服务的多站点输入一致性

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212782

Bharath Balasubramanian, R. Schlichting, P. Zave

{"title":"Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed Services","authors":"Bharath Balasubramanian, R. Schlichting, P. Zave","doi":"10.1145/3212734.3212782","DOIUrl":"https://doi.org/10.1145/3212734.3212782","url":null,"abstract":"Geo-distributed services that are executed across multiple sites at a global scale are increasingly prevalent, and are at the core of the control plane tasked with managing the Virtual Network Functions (VNFs) of next-generation network infrastructure. A key building block of any replicated service of this type is logically shared state, an abstraction that is often implemented by having multiple copies of each data element and using one of any number of distributed protocols to enforce consistency with guarantees ranging from eventual to causal to sequential consistency. These solutions fail to meet the real needs of geo-distributed services found in a VNF control plane (and elsewhere), which are to provide guarantees strong enough to be useful, yet still efficiently implementable in a global network with larger latencies and a wider range of failure modes. Here, we propose a new solution to state consistency based on extending entry consistency, a paradigm originally developed for failure-free multi-processor systems, for use in geo-distributed services with failures. We outline the challenges associated with state consistency in such services, and describe a data-store called MUSIC (MUlti-SIte entry Consistency) that combines an eventually consistent key-value store with locking primitives to implement entry-consistent semantics.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960788","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}

引用次数: 3