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

Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption 简短公告:使用小型可信硬件来容忍少数腐败的高效通信BFT

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

Sravya Yandamuri, Ittai Abraham, Kartik Nayak, M. Reiter

引用次数: 6

Brief Announcement: Auditable Register Emulations 简短公告:可审计的寄存器模拟

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

V. Cogo, A. Bessani

{"title":"Brief Announcement: Auditable Register Emulations","authors":"V. Cogo, A. Bessani","doi":"10.4230/LIPIcs.DISC.2021.53","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.53","url":null,"abstract":"We initiate the study of auditable storage emulations, which provide the capability for an auditor to report the previously executed reads in a register. We define the notion of auditable register and its properties, and establish tight bounds and impossibility results for auditable storage emulations in the presence of faulty base storage objects. Our formulation considers registers that securely store data using information dispersal (each base object stores only a block of the written value) and supporting fast reads (that complete in one communication round-trip). In such a scenario, given a maximum number f of faulty storage objects and a minimum number τ of data blocks required to recover a stored value, we prove that (R1) auditability is impossible if τ ≤ 2f ; (R2) implementing a weak form of auditability requires τ ≥ 3f + 1; and (R3) a stronger form of auditability is impossible. We also show that (R4) signing read requests generically overcomes the lower bound of weak auditability, while (R5 and R6) totally ordering operations or using non-fast reads enables strong auditability. These results establish that practical storage emulations need f to 2f additional objects compared to their original lower bounds to support auditability. 2012 ACM Subject Classification Computing methodologies → Distributed algorithms; Computer systems organization → Reliability; Security and privacy → Information accountability and usage control; Applied computing → Evidence collection, storage and analysis","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"12 1","pages":"53:1-53:4"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78263036","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

Byzantine Consensus with Local Multicast Channels 局部多播信道的拜占庭一致性

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

M. S. Khan, N. Vaidya

{"title":"Byzantine Consensus with Local Multicast Channels","authors":"M. S. Khan, N. Vaidya","doi":"10.4230/LIPIcs.DISC.2021.26","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.26","url":null,"abstract":"Byzantine consensus is a classical problem in distributed computing. Each node in a synchronous system starts with a binary input. The goal is to reach agreement in the presence of Byzantine faulty nodes. We consider the setting where communication between nodes is modelled via an undirected communication graph. In the classical point-to-point communication model all messages sent on an edge are private between the two endpoints of the edge. This allows a faulty node to equivocate, i.e., lie differently to its different neighbors. Different models have been proposed in the literature that weaken equivocation. In the local broadcast model, every message transmitted by a node is received identically and correctly by all of its neighbors. In the hypergraph model, every message transmitted by a node on a hyperedge is received identically and correctly by all nodes on the hyperedge. Tight network conditions are known for each of the three cases. We introduce a more general model that encompasses all three of these models. In the local multicast model, each node u has one or more local multicast channels. Each channel consists of multiple neighbors of u in the communication graph. When node u sends a message on a channel, it is received identically by all of its neighbors on the channel. For this model, we identify tight network conditions for consensus. We observe how the local multicast model reduces to each of the three models above under specific conditions. In each of the three cases, we relate our network condition to the corresponding known tight conditions. The local multicast model also encompasses other practical network models of interest that have not been explored previously, as elaborated in the paper. 2012 ACM Subject Classification Theory of computation → Distributed algorithms","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"183 1","pages":"26:1-26:16"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74633265","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

Wait-Free CAS-Based Algorithms: The Burden of the Past 无等待cas算法:过去的负担

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

D. Bédin, F. Lépine, A. Mostéfaoui, D. Pérez, Matthieu Perrin

{"title":"Wait-Free CAS-Based Algorithms: The Burden of the Past","authors":"D. Bédin, F. Lépine, A. Mostéfaoui, D. Pérez, Matthieu Perrin","doi":"10.4230/LIPIcs.DISC.2021.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.11","url":null,"abstract":"Herlihy proved that CAS is universal in the classical computing system model composed of an a priori known number of processes. This means that CAS can implement, together with reads and writes, any object with a sequential specification. For this, he proposed the first universal construction capable of emulating any data structure. It has recently been proved that CAS is still universal in the infinite arrival computing model, a model where any number of processes can be created on the fly (e.g. multi-threaded systems). In this paper, we prove that CAS does not allow to implement wait-free and linearizable visible objects in the infinite model with a space complexity bounded by the number of active processes (i.e. ones that have operations in progress on this object). This paper also shows that this lower bound is tight, in the sense that this dependency can be made as low as desired (e.g. logarithmic) by proposing a wait-free and linearizable universal construction, using the compare-and-swap operation, whose space complexity in the number of ever issued operations is defined by a parameter that can be linked to any unbounded function. 2012 ACM Subject Classification Theory of computation → Distributed computing models; Software and its engineering → Process synchronization; Computer systems organization → Multicore architectures; Computer systems organization → Dependable and fault-tolerant systems and networks","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"54 1","pages":"11:1-11:15"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75626451","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

General CONGEST Compilers against Adversarial Edges 针对对抗边的一般拥塞编译器

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

Yael Hitron, M. Parter

{"title":"General CONGEST Compilers against Adversarial Edges","authors":"Yael Hitron, M. Parter","doi":"10.4230/LIPIcs.DISC.2021.24","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.24","url":null,"abstract":"We consider the adversarial CONGEST model of distributed computing in which a fixed number of edges (or nodes) in the graph are controlled by a computationally unbounded adversary that corrupts the computation by sending malicious messages over these (a-priori unknown) controlled edges. As in the standard CONGEST model, communication is synchronous, where per round each processor can send O ( log n ) bits to each of its neighbors. This paper is concerned with distributed algorithms that are both time efficient (in terms of the number of rounds), as well as, robust against a fixed number of adversarial edges. Unfortunately, the existing algorithms in this setting usually assume that the communication graph is complete ( n -clique), and very little is known for graphs with arbitrary topologies. We fill in this gap by extending the methodology of [Parter and Yogev, SODA 2019] and provide a compiler that simulates any CONGEST algorithm A (in the reliable setting) into an equivalent algorithm A ′ in the adversarial CONGEST model. Specifically, we show the following for every ( 2 f + 1 ) edge-connected graph of diameter D :","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"76 1","pages":"24:1-24:18"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85979089","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

Spread of Information and Diseases via Random Walks in Sparse Graphs 稀疏图中随机游走的信息和疾病传播

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-10-12 DOI: 10.4230/LIPIcs.DISC.2020.9

George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald

{"title":"Spread of Information and Diseases via Random Walks in Sparse Graphs","authors":"George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald","doi":"10.4230/LIPIcs.DISC.2020.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.9","url":null,"abstract":"We consider a natural network diffusion process, modeling the spread of information or infectious diseases. Multiple mobile agents perform independent simple random walks on an $n$-vertex connected graph $G$. The number of agents is linear in $n$ and the walks start from the stationary distribution. Initially, a single vertex has a piece of information (or a virus). An agent becomes informed (or infected) the first time it visits some vertex with the information (or virus); thereafter, the agent informs (infects) all vertices it visits. Giakkoupis et al. (PODC'19) have shown that the spreading time, i.e., the time before all vertices are informed, is asymptotically and w.h.p. the same as in the well-studied randomized rumor spreading process, on any $d$-regular graph with $d = Omega(log n)$. The case of sub-logarithmic degree was left open, and is the main focus of this paper. First, we observe that the equivalence shown by Giakkoupis et al. does not hold for small $d$: We give an example of a 3-regular graph with logarithmic diameter for which the expected spreading time is $Omega(log^2 n/ log log n)$, whereas randomized rumor spreading is completed in time $Theta(log n)$, w.h.p. Next, we show a general upper bound of $tilde O(d cdot diam(G) + log^3 n/d)$, w.h.p., for the spreading time on any $d$-regular graph. We also provide a version of the bound based on the average degree, for non-regular graphs. Next, we give tight analyses for specific graph families. We show that the spreading time is $O(log n)$, w.h.p., for constant-degree regular expanders. For the binary tree, we show an upper bound of $O(log n cdot log log n)$, w.h.p., and prove that this is tight, by giving a matching lower bound for the cover time of the tree by $n$ random walks. Finally, we show a bound of $O(diam(G))$, w.h.p., for $k$-dimensional grids, by adapting a technique by Kesten and Sidoravicius.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"116 1","pages":"9:1-9:17"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87659086","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: Game Theoretical Framework for Analyzing Blockchains Robustness 简要公告:分析区块链鲁棒性的博弈论框架

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-10-12 DOI: 10.4230/LIPIcs.DISC.2020.49

P. Zappalà, M. Belotti, M. Potop-Butucaru, Stefano Secci

引用次数: 1

Fully Read/Write Fence-Free Work-Stealing with Multiplicity 完全读/写无围栏工作窃取与多样性

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-10 DOI: 10.4230/LIPIcs.DISC.2021.16

Armando Castañeda, Miguel Piña

{"title":"Fully Read/Write Fence-Free Work-Stealing with Multiplicity","authors":"Armando Castañeda, Miguel Piña","doi":"10.4230/LIPIcs.DISC.2021.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2021.16","url":null,"abstract":"Work-stealing is a popular technique to implement dynamic load balancing in a distributed manner. In this approach, each process owns a set of tasks that have to be executed. The owner of the set can put tasks in it and can take tasks from it to execute them. When a process runs out of tasks, instead of being idle, it becomes a thief to steal tasks from a victim. Thus, a work-stealing algorithm provides three high-level operations: Put and Take, which can be invoked only by the owner, and Steal, which can be invoked by a thief. \u0000One of the main targets when designing work-stealing algorithms is to make Put and Take as simple and efficient as possible. Unfortunately, it has been shown that any work-stealing algorithm in the standard asynchronous model must use expensive Read-After-Write synchronization patterns or atomic Read-Modify-Write instructions (e.g. CompareS however, Put uses fences among Write instructions, and Steal uses Compare&Swap and fences among Read instructions. \u0000This paper considers work-stealing with multiplicity, a relaxation in which every task is taken by at least one operation, with the requirement that any process can extract a task at most once. Three versions of the relaxation are considered and fully Read/Write algorithms are presented in the standard asynchronous model, all of them devoid of Read-After-Write synchronization patterns; the last algorithm is also fully fence-free.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"11 1","pages":"16:1-16:20"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83754435","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}

引用次数: 8

Improved Bounds for Distributed Load Balancing 改进的分布式负载平衡边界

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-10 DOI: 10.4230/LIPIcs.DISC.2020.1

Sepehr Assadi, A. Bernstein, Zachary Langley

{"title":"Improved Bounds for Distributed Load Balancing","authors":"Sepehr Assadi, A. Bernstein, Zachary Langley","doi":"10.4230/LIPIcs.DISC.2020.1","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.1","url":null,"abstract":"In the load balancing problem, the input is an $n$-vertex bipartite graph $G = (C cup S, E)$ and a positive weight for each client $c in C$. The algorithm must assign each client $c in C$ to an adjacent server $s in S$. The load of a server is then the weighted sum of all the clients assigned to it. The goal is to compute an assignment that minimizes some function of the server loads, typically either the maximum server load (i.e., the $ell_{infty}$-norm) or the $ell_p$-norm of the server loads. \u0000We study load balancing in the distributed setting. There are two existing results in the CONGEST model. Czygrinow et al. [DISC 2012] showed a 2-approximation for unweighted clients with round-complexity $O(Delta^5)$, where $Delta$ is the maximum degree of the input graph. Halldorsson et al. [SPAA 2015] showed an $O(log{n}/loglog{n})$-approximation for unweighted clients and $O(log^2!{n}/loglog{n})$-approximation for weighted clients with round-complexity polylog$(n)$. \u0000In this paper, we show the first distributed algorithms to compute an $O(1)$-approximation to the load balancing problem in polylog$(n)$ rounds. In the CONGEST model, we give an $O(1)$-approximation algorithm in polylog$(n)$ rounds for unweighted clients. For weighted clients, the approximation ratio is $O(log{n})$. In the less constrained LOCAL model, we give an $O(1)$-approximation algorithm for weighted clients in polylog$(n)$ rounds. \u0000Our approach also has implications for the standard sequential setting in which we obtain the first $O(1)$-approximation for this problem that runs in near-linear time. A 2-approximation is already known, but it requires solving a linear program and is hence much slower. Finally, we note that all of our results simultaneously approximate all $ell_p$-norms, including the $ell_{infty}$-norm.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"57 1","pages":"1:1-1:15"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76003444","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

Communication Efficient Self-Stabilizing Leader Election 沟通高效自稳定领导人选举

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-08-10 DOI: 10.4230/LIPIcs.DISC.2020.11

X. Défago, Y. Emek, S. Kutten, T. Masuzawa, Yasumasa Tamura

{"title":"Communication Efficient Self-Stabilizing Leader Election","authors":"X. Défago, Y. Emek, S. Kutten, T. Masuzawa, Yasumasa Tamura","doi":"10.4230/LIPIcs.DISC.2020.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2020.11","url":null,"abstract":"This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network model, assuming that the nodes know a linear upper bound on $n$ and that each edge has a unique ID known to both its endpoints (or, alternatively, assuming the $KT_{1}$ model). The highlight of this algorithm is its superior communication efficiency: It is guaranteed to send a total of $tilde{O} (n)$ messages, each of constant size, till stabilization, while stabilizing in $tilde{O} (n)$ rounds, in expectation and with high probability. After stabilization, the algorithm sends at most one constant size message per round while communicating only over the ($n - 1$) edges of $T$. In all these aspects, the communication overhead of the new algorithm is far smaller than that of the existing (mostly deterministic) self-stabilizing leader election algorithms. The algorithm is relatively simple and relies mostly on known modules that are common in the fault free leader election literature; these modules are enhanced in various subtle ways in order to assemble them into a communication efficient self-stabilizing algorithm.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80543274","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