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

Efficient Classification of Locally Checkable Problems in Regular Trees 正则树中局部可查问题的有效分类

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2022-02-17 DOI: 10.4230/LIPIcs.DISC.2022.8

A. Balliu, S. Brandt, Yi-Jun Chang, D. Olivetti, Jan Studen'y, J. Suomela

引用次数: 3

On Payment Channels in Asynchronous Money Transfer Systems 论异步转账系统中的支付通道

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2022-02-14 DOI: 10.4230/LIPIcs.DISC.2022.29

O. Naor, I. Keidar

{"title":"On Payment Channels in Asynchronous Money Transfer Systems","authors":"O. Naor, I. Keidar","doi":"10.4230/LIPIcs.DISC.2022.29","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2022.29","url":null,"abstract":"Money transfer is an abstraction that realizes the core of cryptocurrencies. It has been shown that, contrary to common belief, money transfer in the presence of Byzantine faults can be implemented in asynchronous networks and does not require consensus. Nonetheless, existing implementations of money transfer still require a quadratic message complexity per payment, making attempts to scale hard. In common blockchains, such as Bitcoin and Ethereum, this cost is mitigated by payment channels implemented as a second layer on top of the blockchain allowing to make many off-chain payments between two users who share a channel. Such channels only require on-chain transactions for channel opening and closing, while the intermediate payments are done off-chain with constant message complexity. But payment channels in-use today require synchrony, therefore they are inadequate for asynchronous money transfer systems. In this paper, we provide a series of possibility and impossibility results for payment channels in asynchronous money transfer systems. We first prove a quadratic lower bound on the message complexity of on-chain transfers. Then, we explore two types of payment channels, unidirectional and bidirectional. We define them as shared memory abstractions and prove that in certain cases they can be implemented as a second layer on top of an asynchronous money transfer system whereas in other cases it is impossible.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"11 1","pages":"29:1-29:20"},"PeriodicalIF":0.0,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88628478","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}

引用次数: 4

Fragmented ARES: Dynamic Storage for Large Objects 碎片化ARES:大型对象的动态存储

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

Chryssis Georgiou, N. Nicolaou, Andria Trigeorgi

引用次数: 0

It's not easy to relax: liveness in chained BFT protocols 不容易放松:链式BFT协议的活跃性

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2022-01-01 DOI: 10.48550/arXiv.2205.11652

Ittai Abraham, Natacha Crooks, N. Giridharan, H. Howard, Florian Suri-Payer

引用次数: 7

Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach 摘要:分布式算法求解最小支配集问题及其他问题，一种新方法

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

Sharareh Alipour, Mohammadhadi Salari

引用次数: 0

Byzantine Connectivity Testing in the Congested Clique 拥塞集团中的拜占庭连通性测试

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

Jonathan C. Augustine, A. R. Molla, Gopal Pandurangan, Y. Vasudev

{"title":"Byzantine Connectivity Testing in the Congested Clique","authors":"Jonathan C. Augustine, A. R. Molla, Gopal Pandurangan, Y. Vasudev","doi":"10.4230/LIPIcs.DISC.2022.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2022.7","url":null,"abstract":"We initiate the study of distributed graph algorithms under the presence of Byzantine nodes. We consider the fundamental problem of testing the connectivity of a graph in the congested clique model in a Byzantine setting. We are given a n -vertex (arbitrary) graph G embedded in a n -node congested clique where an arbitrary subset of B nodes of the clique of size up to (1 / 3 − ε ) n (for any arbitrary small constant ε > 0) can be Byzantine. We consider the full information model where Byzantine nodes can behave arbitrarily, collude with each other, and have unlimited computational power and full knowledge of the states and actions of the honest nodes, including random choices made up to the current round. Our main result is an efficient randomized distributed algorithm that is able to correctly distinguish between two contrasting cases: (1) the graph G B (i.e., the graph induced by the removal of the vertices assigned to the Byzantine nodes in the clique) is connected or (2) the graph G is far from connected, i.e., it has at least 2 | B | + 1 connected components. Our algorithm runs in O (polylog n ) rounds in the congested clique model and guarantees that all honest nodes will decide on the correct case with high probability. Since Byzantine nodes can lie about the vertices assigned to them, we show that this is essentially the best possible that can be done by any algorithm. Our result can be viewed also in the spirit of property testing, where our algorithm is able to distinguish between two contrasting cases while giving no guarantees if the graph falls in the grey area (i.e., neither of the cases occur). Our work is a step towards robust and secure distributed graph computation that can output meaningful results even in the presence of a large number of faulty or malicious nodes.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"50 1","pages":"7:1-7:21"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83037038","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: New Clocks, Fast Line Formation and Self-Replication Population Protocols 简短公告:新的时钟，快速线路形成和自我复制种群协议

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

L. Gąsieniec, P. Spirakis, Grzegorz Stachowiak

{"title":"Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols","authors":"L. Gąsieniec, P. Spirakis, Grzegorz Stachowiak","doi":"10.4230/LIPIcs.DISC.2022.44","DOIUrl":"https://doi.org/10.4230/LIPIcs.DISC.2022.44","url":null,"abstract":"The model of population protocols is used to study distributed processes based on pairwise interactions between anonymous agents drawn from a large population of size n. The interacting pairs of agents are chosen by the random scheduler and their states are amended by the predeﬁned transition function which governs the considered process. The state space of agents is ﬁxed (constant size) and the size n is not known, i.e., not hard-coded in the transition function. We assume that a population protocol starts in the predeﬁned initial conﬁguration of agents’ states representing the input, and it concludes in an output conﬁguration representing the solution to the considered problem. The time complexity of a protocol refers to the number of interactions required to stabilise this protocol in a ﬁnal conﬁguration. The parallel time is deﬁned as the time complexity divided by n. In this paper we consider a known variant of the standard population protocol model in which agents can be connected by edges, referred to as the network constructor model. During an interaction between two agents the relevant connecting edge can be formed, maintained or eliminated by the transition function. Since pairs of agents are chosen uniformly at random the status of each edge is updated every Θ( n 2 ) interactions in expectation which coincides with Θ( n ) parallel time. This phenomenon provides a natural lower bound on the time complexity for any non-trivial network construction designed for this variant. This is in contrast with the standard population protocol model in which eﬃcient protocols operate in O ( poly log n ) parallel time. The main focus in this paper is on eﬃcient manipulation of linear structures including formation, self-replication and distribution (including pipelining) of complex information in the adopted model.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"36 1","pages":"44:1-44:3"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88547218","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: Gathering Despite Defected View 简短公告:尽管视野有缺陷，但仍在聚集

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

Yonghwan Kim, M. Shibata, Y. Sudo, Junya Nakamura, Y. Katayama, T. Masuzawa

引用次数: 0

Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk) 在随机并发程序中使用线性化对象(特邀讲座)

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

J. Welch

引用次数: 0

Brief Announcement: Asymmetric Mutual Exclusion for RDMA 简短公告:RDMA的非对称互斥

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

J. Nelson-Slivon, Lewis Tseng, R. Palmieri

引用次数: 0