Proceedings of the ... International Symposium on High Performance Distributed Computing最新文献_第8页

Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions 任意多进程和会话的恒定RMR组互斥

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.30

L. Maor, G. Taubenfeld

{"title":"Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions","authors":"L. Maor, G. Taubenfeld","doi":"10.4230/LIPIcs.DISC.2021.30","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.30","url":null,"abstract":"Group mutual exclusion (GME), introduced by Joung in 1998, is a natural synchronization problem that generalizes the classical mutual exclusion and readers and writers problems. In GME a process requests a session before entering its critical section; processes are allowed to be in their critical sections simultaneously provided they have requested the same session. We present a GME algorithm that (1) is the first to achieve a constant Remote Memory Reference (RMR) complexity for both cache coherent and distributed shared memory machines; and (2) is the first that can be accessed by arbitrarily many dynamically allocated processes and with arbitrarily many session names. Neither of the existing GME algorithms satisfies either of these two important properties. In addition, our algorithm has constant space complexity per process and satisfies the two strong fairness properties, first-come-first-served and first-in-first-enabled. Our algorithm uses an atomic instruction set supported by most modern processor architectures, namely: read, write, fetch-and-store and compare-and-swap. We thank the anonymous referees for their constructive suggestions.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"61 1","pages":"30:1-30:16"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91350610","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}

引用次数: 0

Ruling Sets in Random Order and Adversarial Streams 随机顺序的统治集与对抗流

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.6

Sepehr Assadi, Aditi Dudeja

{"title":"Ruling Sets in Random Order and Adversarial Streams","authors":"Sepehr Assadi, Aditi Dudeja","doi":"10.4230/LIPIcs.DISC.2021.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.6","url":null,"abstract":"The goal of this paper is to understand the complexity of a key symmetry breaking problem, namely the ( α, β )-ruling set problem in the graph streaming model. Given a graph G = ( V, E ), an ( α, β )-ruling set is a subset I ⊆ V such that the distance between any two vertices in I is at least α and the distance between a vertex in V and the closest vertex in I is at most β . This is a fundamental problem in distributed computing where it finds applications as a useful subroutine for other problems such as maximal matching, distributed colouring, or shortest paths. Additionally, it is a generalization of MIS, which is a (2 , 1)-ruling set. Our main results are two algorithms for (2 , 2)-ruling sets: adversarial order in which edges arrive arbitrary, we give an n 3 upon the best known algorithm to Konrad et al. [DISC 2019], Finally, we present new algorithms and lower bounds for ( α, β )-ruling sets for other values of α and β . Our algorithms improve and generalize the previous work of Konrad et al. [DISC 2019] for (2 , β )-ruling sets, while our lower bound establishes the impossibility of obtaining any non-trivial streaming algorithm for ( α, α − 1)-ruling sets for all even α > 2.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"15 1","pages":"6:1-6:18"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90308629","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

Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency 简短公告:加密货币的有序可靠广播和快速有序拜占庭共识

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.63

Pouriya Zarbafian, V. Gramoli

{"title":"Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency","authors":"Pouriya Zarbafian, V. Gramoli","doi":"10.4230/LIPIcs.DISC.2021.63","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.63","url":null,"abstract":"The problem of transaction reordering in blockchains, also known as the blockchain anomaly [11], can lead to fairness limitations [8] and front-running activities [6] in cryptocurrency. To cope with this problem despite f < n3 byzantine processes, Zhang et al. [12] have introduced the ordering linearizability property ensuring that if two transactions or commands are perceived by all correct processes in the same order, then they are executed in this order. They proposed a generic distributed protocol that first orders commands and then runs a leader-based consensus protocol to agree on these orders, hence requiring at least 11 message delays. In this paper, we parallelize the ordering with the execution of the consensus to require only 6 message delays. For the ordering, we introduce the ordered reliable broadcast primitive suitable for broadcast-based cryptocurrencies (e.g., [3]). For the agreement, we build upon the DBFT leaderless consensus protocol [4] that was recently formally verified [1]. The combination is thus suitable to ensure ordering linearizability in consensus-based cryptocurrencies (e.g., [5]). 2012 ACM Subject Classification Computing methodologies → Distributed algorithms","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"121 1","pages":"63:1-63:4"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81683594","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: Persistent Software Combining 简短公告:持久的软件组合

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.56

P. Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas

引用次数: 2

Optimal Communication Complexity of Authenticated Byzantine Agreement 认证拜占庭协议的最优通信复杂度

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.32

Atsuki Momose, Ling Ren

引用次数: 26

Tech Transfer Stories and Takeaways (Invited Talk) 技术转移的故事及要点(特邀讲座)

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.2

D. Malkhi

引用次数: 0

Fast Arrays: Atomic Arrays with Constant Time Initialization 快速数组:具有常数时间初始化的原子数组

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.25

S. Jayanti, Julian Shun

{"title":"Fast Arrays: Atomic Arrays with Constant Time Initialization","authors":"S. Jayanti, Julian Shun","doi":"10.4230/LIPIcs.DISC.2021.25","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.25","url":null,"abstract":"Some algorithms require a large array, but only operate on a small fraction of its indices. Examples include adjacency matrices for sparse graphs, hash tables, and van Emde Boas trees. For such algorithms, array initialization can be the most time-consuming operation. Fast arrays were invented to avoid this costly initialization. A fast array is a software implementation of an array, such that the entire array can be initialized in just constant time. While algorithms for sequential fast arrays have been known for a long time, to the best of our knowledge, there are no previous algorithms for concurrent fast arrays. We present the first such algorithms in this paper. Our first algorithm is linearizable and wait-free, uses only linear space, and supports all operations – initialize, read, and write – in constant time. Our second algorithm enhances the first to additionally support all the read-modify-write operations available in hardware (such as compare-and-swap) in constant time. 2012 ACM Subject Classification Theory of computation → Concurrent algorithms; Theory of computation → Data structures design and analysis","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"14 1","pages":"25:1-25:19"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76194535","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}

引用次数: 0

Brief Announcement: Twins - BFT Systems Made Robust 简短公告:双胞胎- BFT系统变得健壮

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.46

S. Bano, A. Sonnino, A. Chursin, D. Perelman, Zekun Li, A. Ching, D. Malkhi

{"title":"Brief Announcement: Twins - BFT Systems Made Robust","authors":"S. Bano, A. Sonnino, A. Chursin, D. Perelman, Zekun Li, A. Ching, D. Malkhi","doi":"10.4230/LIPIcs.DISC.2021.46","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.46","url":null,"abstract":"Twins is an effective strategy for generating test scenarios with Byzantine [10] nodes in order to find flaws in Byzantine Fault Tolerant (BFT) systems. Twins finds flaws in the design or implementation of BFT protocols that may cause correctness issues. The main idea of Twins is the following: running twin instances of a node that use correct, unmodified code and share the same network identity and credentials allows to emulate most interesting Byzantine behaviors. Because a twin executes normal, unmodified node code, building Twins only requires a thin wrapper over an existing distributed system designed for Byzantine tolerance. To emulate material, interesting scenarios with Byzantine nodes, it instantiates one or more twin copies of the node, giving the twins the same identities and network credentials as the original node. To the rest of the system, the node and all its twins appear indistinguishable from a single node behaving in a “questionable” manner. This approach generates many interesting Byzantine behaviors, including equivocation, double voting, and losing internal state, while forgoing uninteresting behavior scenarios that can be filtered at the transport layer, such as producing semantically invalid messages. Building on configurations with twin nodes, Twins systematically generates scenarios with Byzantine nodes via enumeration over protocol rounds and communication patterns among nodes. Despite this being inherently exponential, one new flaw and several known flaws were materialized by Twins in the arena of BFT consensus protocols. In all cases, protocols break within fewer than a dozen protocol rounds, hence it is realistic for the Twins approach to expose the problems. In two of these cases, it took the community more than a decade to discover protocol flaws that Twins would have surfaced within minutes. Additionally, Twins has been incorporated into the continuous release testing process of a production setting (DiemBFT","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"21 1","pages":"46:1-46:4"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91554493","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}

引用次数: 0

Extension-Based Proofs for Synchronous Message Passing 同步消息传递的基于扩展的证明

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.36

Yilun Sheng, Faith Ellen

{"title":"Extension-Based Proofs for Synchronous Message Passing","authors":"Yilun Sheng, Faith Ellen","doi":"10.4230/LIPIcs.DISC.2021.36","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.36","url":null,"abstract":"There is no wait-free algorithm that solves k-set agreement among n ≥ k+1 processes in asynchronous systems where processes communicate using only registers. However, proofs of this result for k ≥ 2 are complicated and involve topological reasoning. To explain why such sophisticated arguments are necessary, Alistarh, Aspnes, Ellen, Gelashvili, and Zhu recently introduced extension-based proofs, which generalize valency arguments, and proved that there are no extension-based proofs of this result. In the synchronous message passing model, k-set agreement is solvable, but there is a lower bound of t rounds for any k-set agreement algorithm among n > kt processes when at most k processes can crash each round. The proof of this result for k ≥ 2 is also a complicated topological argument. We define a notion of extension-based proofs for this model and we show there are no extension-based proofs that t rounds are necessary for any k-set agreement algorithm among n = kt + 1 processes, for k ≥ 2 and t > 2, when at most k processes can crash each round. In particular, our result shows that no valency argument can prove this lower bound. 2012 ACM Subject Classification Theory of computation → Interactive proof systems; Theory of computation → Complexity theory and logic; Theory of computation → Distributed algorithms; Theory of computation → Distributed computing models","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"9 1","pages":"36:1-36:17"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78692153","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}

引用次数: 2

Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols 简要公告:分布式协议参数化验证的自动化和机械化截止证明

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.DISC.2021.48

Shreesha G. Bhat, Kartik Nagar

引用次数: 0