MULTI-WRITER COMPOSITE REGISTERS

被引:38
|
作者
ANDERSON, JH
机构
[1] Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, 27599-3175, NC
关键词
ATOMICITY; ATOMIC REGISTER; COMPOSITE REGISTER; CONCURRENCY; INTERLEAVING SEMANTICS; LINEARIZABILITY; SHARED VARIABLE; SNAPSHOT;
D O I
10.1007/BF02280833
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A composite register is an array-like shared data object that is partitioned into a number of components. An operation of such a register either writes a value to a single component, or reads the values of all components. A composite register reduces to an ordinary atomic register when there is only one component. In this paper, we show that a composite register with multiple writers per component can be implemented in a wait-free manner from a composite register with a single writer per component. It has been previously shown that registers of the latter kind can be implemented from atomic registers without waiting. Thus, our results establish that any composite register can be implemented in a wait-free manner from atomic registers. We show that our construction has comparable space compexity and better time complexity than other constructions that have been presented in the literature.
引用
收藏
页码:175 / 195
页数:21
相关论文
共 50 条
  • [1] ON INTERPROCESS COMMUNICATION AND THE IMPLEMENTATION OF MULTI-WRITER ATOMIC REGISTERS
    ABRAHAM, U
    THEORETICAL COMPUTER SCIENCE, 1995, 149 (02) : 257 - 298
  • [2] Towards Feasible Implementations of Low-Latency Multi-Writer Atomic Registers
    Georgiou, Chryssis
    Nicolaou, Nicolas
    Russell, Alexander C.
    Shvartsman, Alexander A.
    2011 10TH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2011,
  • [3] Advancing Multi-writer Snapshots Algorithm
    Sharma, Sudhanshu
    Mahato, Dharmendra Prasad
    ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 1, AINA 2024, 2024, 199 : 310 - 318
  • [4] The Complexity of Updating Multi-Writer Snapshot Objects
    Attiya, Hagit
    Ellen, Faith
    Fatourou, Panagiota
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 318 - 319
  • [5] Byzantine and multi-writer k-quorums
    Aiyer, Amitanand S.
    Alvisi, Lorenzo
    Bazzi, Rida A.
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 443 - 458
  • [6] Secure Queries on Encrypted Multi-Writer Tables
    Perillo, Angelo Massimo
    Persiano, Giuseppe
    Trombetta, Alberto
    2017 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P), 2017, : 127 - 141
  • [7] The complexity of updating multi-writer snapshot objects
    Attiya, Hagit
    Ellen, Faith
    Fatourou, Panagiota
    DISTRIBUTED COMPUTING AND NETWORKING, PROCEEDINGS, 2006, 4308 : 319 - 330
  • [8] Secure Selections on Encrypted Multi-writer Streams
    Perillo, Angelo Massimo
    Persiano, Giuseppe
    Trombetta, Alberto
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2022, 25 (01)
  • [9] Multi-writer Multi-reader Boolean Keyword Searchable Encryption
    Dhruti Sharma
    Devesh Jinwala
    Arabian Journal for Science and Engineering, 2020, 45 : 10709 - 10729
  • [10] Time lower bounds for implementations of multi-writer snapshots
    Ellen, Faith
    Fatourou, Panagiota
    Ruppert, Eric
    JOURNAL OF THE ACM, 2007, 54 (06)