Proceedings of the ... International Symposium on High Performance Distributed Computing最新文献

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks 一步前进，一步后退:flp风格的证明和圆减少技术的无色任务

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-08-08 DOI: 10.48550/arXiv.2308.04213

H. Attiya, P. Fraigniaud, A. Paz, S. Rajsbaum

{"title":"One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks","authors":"H. Attiya, P. Fraigniaud, A. Paz, S. Rajsbaum","doi":"10.48550/arXiv.2308.04213","DOIUrl":"https://doi.org/10.48550/arXiv.2308.04213","url":null,"abstract":"The paper compares two generic techniques for deriving lower bounds and impossibility results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for wait-free colorless algorithms, aiming at capturing the essence of the seminal round-reduction proof establishing a lower bound on the number of rounds for 3-coloring a cycle (Linial, 1992), and going by backward induction. Second, we consider FLP-style proofs, aiming at capturing the essence of the seminal consensus impossibility proof (Fischer, Lynch, and Paterson, 1985) and using forward induction. We show that despite their very different natures, these two forms of proof are tightly connected. In particular, we show that for every colorless task $Pi$, if there is a round-reduction proof establishing the impossibility of solving $Pi$ using wait-free colorless algorithms, then there is an FLP-style proof establishing the same impossibility. For 1-dimensional colorless tasks (for an arbitrary number $ngeq 2$ of processes), we prove that the two proof techniques have exactly the same power, and more importantly, both are complete: if a 1-dimensional colorless task is not wait-free solvable by $ngeq 2$ processes, then the impossibility can be proved by both proof techniques. Moreover, a round-reduction proof can be automatically derived, and an FLP-style proof can be automatically generated from it. Finally, we illustrate the use of these two techniques by establishing the impossibility of solving any colorless covering task of arbitrary dimension by wait-free algorithms.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"11 1","pages":"4:1-4:23"},"PeriodicalIF":0.0,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79710243","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

Gorilla: Safe Permissionless Byzantine Consensus 大猩猩:安全的无许可拜占庭共识

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-08-08 DOI: 10.48550/arXiv.2308.04080

Youer Pu, A. Farahbakhsh, L. Alvisi, Ittay Eyal

引用次数: 1

Fast Coloring Despite Congested Relays 尽管拥挤的继电器快速着色

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-08-02 DOI: 10.48550/arXiv.2308.01359

Maxime Flin, Magn'us M. Halld'orsson, Alexandre Nolin

引用次数: 1

Distributed Certification for Classes of Dense Graphs 密集图类的分布式证明

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-07-26 DOI: 10.48550/arXiv.2307.14292

P. Fraigniaud, Frédéric Mazoit, Pedro Montealegre, I. Rapaport, Ioan Todinca

{"title":"Distributed Certification for Classes of Dense Graphs","authors":"P. Fraigniaud, Frédéric Mazoit, Pedro Montealegre, I. Rapaport, Ioan Todinca","doi":"10.48550/arXiv.2307.14292","DOIUrl":"https://doi.org/10.48550/arXiv.2307.14292","url":null,"abstract":"A proof-labeling scheme (PLS) for a boolean predicate $Pi$ on labeled graphs is a mechanism used for certifying the legality with respect to $Pi$ of global network states in a distributed manner. In a PLS, a certificate is assigned to each processing node of the network, and the nodes are in charge of checking that the collection of certificates forms a global proof that the system is in a correct state, by exchanging the certificates once, between neighbors only. The main measure of complexity is the size of the certificates. Many PLSs have been designed for certifying specific predicates, including cycle-freeness, minimum-weight spanning tree, planarity, etc. In 2021, a breakthrough has been obtained, as a meta-theorem stating that a large set of properties have compact PLSs in a large class of networks. Namely, for every $mathrm{MSO}_2$ property $Pi$ on labeled graphs, there exists a PLS for $Pi$ with $O(log n)$-bit certificates for all graphs of bounded tree-depth. This result has been extended to the larger class of graphs with bounded {tree-width}, using certificates on $O(log^2 n)$ bits. We extend this result even further, to the larger class of graphs with bounded clique-width, which, as opposed to the other two aforementioned classes, includes dense graphs. We show that, for every $mathrm{MSO}_1$ property $Pi$ on labeled graphs, there exists a PLS for $Pi$ with $O(log^2 n)$ bit certificates for all graphs of bounded clique-width.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"4175 4 1","pages":"20:1-20:17"},"PeriodicalIF":0.0,"publicationDate":"2023-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86775102","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

Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues 多重队列消息传递实现的改进和部分紧下界

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-05-18 DOI: 10.48550/arXiv.2305.11286

Anh Tran, Edward Talmage

{"title":"Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues","authors":"Anh Tran, Edward Talmage","doi":"10.48550/arXiv.2305.11286","DOIUrl":"https://doi.org/10.48550/arXiv.2305.11286","url":null,"abstract":"A multiplicity queue is a concurrently-defined data type which relaxes the conditions of a linearizable FIFO queue to allow concurrent Dequeue instances to return the same value. It would seem that this should allow faster implementations, as processes should not need to wait as long to learn about concurrent operations at remote processes and previous work has shown that multiplicity queues are computationally less complex than the unrelaxed version. Intriguingly, recent work has shown that there is, in fact, not much speedup possible versus an unrelaxed queue implementation. Seeking to understand this difference between intuition and real behavior, we extend that work, increasing the lower bound for uniform algorithms. Further, we outline a path forward toward building proofs for even higher lower bounds, allowing us to hypothesize that the worst-case time to Dequeue approaches maximum message delay, which is similar to the time required for an unrelaxed Dequeue. We also give an upper bound for a special case to show that our bounds are tight at that point. To achieve our lower bounds, we use extended shifting arguments, which have been rarely used but allow larger lower bounds than traditional shifting arguments. We use these in series of inductive indistinguishability proofs which allow us to extend our proofs beyond the usual limitations of shifting arguments. This proof structure is an interesting contribution independently of the main result, as developing new lower bound proof techniques may have many uses in future work.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"109 1","pages":"34:1-34:20"},"PeriodicalIF":0.0,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74846701","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

Base Fee Manipulation In Ethereum's EIP-1559 Transaction Fee Mechanism 以太坊EIP-1559交易费用机制中的基础费用操纵

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-04-22 DOI: 10.4230/LIPIcs.DISC.2023.11

Sarah Azouvi, G. Goren, A. Hicks, Lioba Heimbach

引用次数: 1

The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList 访问控制对象的同步能力(一致数):以AllowList和DenyList为例

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2023-02-13 DOI: 10.4230/LIPIcs.DISC.2023.39

Davide Frey, Mathieu Gestin, M. Raynal

引用次数: 2

Topological Characterization of Task Solvability in General Models of Computation 一般计算模型中任务可解性的拓扑表征

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

H. Attiya, Armando Castañeda, Thomas Nowak

{"title":"Topological Characterization of Task Solvability in General Models of Computation","authors":"H. Attiya, Armando Castañeda, Thomas Nowak","doi":"10.48550/arXiv.2301.13837","DOIUrl":"https://doi.org/10.48550/arXiv.2301.13837","url":null,"abstract":"The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex representing the inputs to the simplicial complex representing the allowable outputs. The original theorem relies on a correspondence between protocols and simplicial maps in round-structured models of computation that induce a compact topology. This correspondence, however, is far from obvious for computation models that induce a non-compact topology, and indeed previous attempts to extend the ACT have failed. This paper shows that in every non-compact model, protocols solving tasks correspond to simplicial maps that need to be continuous. It first proves a generalized ACT for sub-IIS models, some of which are non-compact, and applies it to the set agreement task. Then it proves that in general models too, protocols are simplicial maps that need to be continuous, hence showing that the topological approach is universal. Finally, it shows that the approach used in ACT that equates protocols and simplicial complexes actually works for every compact model. Our study combines, for the first time, combinatorial and point-set topological aspects of the executions admitted by the computation model.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"86 1","pages":"5:1-5:21"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80818528","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

Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining 动态连接可写LL/SC和CAS的持久算法

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

P. Jayanti, S. Jayanti, Sucharita Jayanti

{"title":"Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining","authors":"P. Jayanti, S. Jayanti, Sucharita Jayanti","doi":"10.48550/arXiv.2302.00135","DOIUrl":"https://doi.org/10.48550/arXiv.2302.00135","url":null,"abstract":"We present durable implementations for two well known universal primitives -- CAS (compare-and-swap), and its ABA-free counter-part LLSC (load-linked, store-conditional). All our implementations are: writable, meaning they support a Write() operation; have constant time complexity per operation; allow for dynamic joining, meaning newly created processes (a.k.a. threads) of arbitrary names can join a protocol and access our implementations; and have adaptive space complexities, meaning the space use scales in the number of processes $n$ that actually use the objects, as opposed to previous protocols which are designed for a maximum number of processes $N$. Our durable Writable-CAS implementation, DuraCAS, requires $O(m + n)$ space to support $m$ objects that get accessed by $n$ processes, improving on the state-of-the-art $O(m + N^2)$. By definition, LLSC objects must store\"contexts\"in addition to object values. Our Writable-LLSC implementation, DuraLL, requires $O(m + n + C)$ space, where $C$ is the number of\"contexts\"stored across all the objects. While LLSC has an advantage over CAS due to being ABA-free, the object definition seems to require additional space usage. To address this trade-off, we define an External Context (EC) variant of LLSC. Our EC Writable-LLSC implementation is ABA-free and has a space complexity of just $O(m + n)$. To our knowledge, we are the first to present durable CAS algorithms that allow for dynamic joining, and our algorithms are the first to exhibit adaptive space complexities. To our knowledge, we are the first to implement any type of durable LLSC objects.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"14 1","pages":"25:1-25:20"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87572598","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

Foraging in Particle Systems via Self-Induced Phase Changes 通过自诱导相变的粒子系统觅食

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

Shunhao Oh, Dana Randall, A. Richa

{"title":"Foraging in Particle Systems via Self-Induced Phase Changes","authors":"Shunhao Oh, Dana Randall, A. Richa","doi":"10.48550/arXiv.2208.10720","DOIUrl":"https://doi.org/10.48550/arXiv.2208.10720","url":null,"abstract":"The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shifted, which may occur at arbitrary times. We would like the particles to iteratively self-organize, using only local interactions, to correctly gather whenever a food particle remains in a position long enough and search if no food particle has existed recently. Unlike previous approaches, these search and gather phases should be self-induced so as to be indefinitely repeatable as the food evolves, with microscopic changes to the food triggering macroscopic, system-wide phase transitions. We present a stochastic foraging algorithm based on a phase change in the fixed magnetization Ising model from statistical physics: Our algorithm is the first to leverage self-induced phase changes as an algorithmic tool. A key component of our algorithm is a careful token passing mechanism ensuring a dispersion broadcast wave will always outpace a compression wave. We also present a highly structured alternative algorithm that gathers by incrementally building a spiral tightly wrapped around the food particle.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"51:1-51:3"},"PeriodicalIF":0.0,"publicationDate":"2022-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79751398","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