skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 1816922

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing)
    Full Text Available 
  2. ; ; ; (, Information and Computation)
    Full Text Available 
  3. ; ; ; (, 39th Symposium on Principles of Distributed Computing)
    Full Text Available 
  4. ; ; ; (, Stabilization, Safety, and Security of Distributed Systems (SSS))
    null (Ed.)
    We present an algorithm for implementing a store-collect object in an asynchronous crash-prone message-passing dynamic system, where nodes continually enter and leave. The algorithm is very simple and efficient, requiring just one round trip for a store operation and two for a collect. We then show the versatility of the store-collect object for implementing churn-tolerant versions of useful data structures, while shielding the user from the complications of the underlying churn. In particular, we present elegant and efficient implementations of atomic snapshot and generalized lattice agreement objects that use store-collect. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; ; (, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing)
    We consider the problem of simulating a k-valued register in a wait- free manner using binary registers as building blocks, where k > 2. We show that for any simulation using atomic binary base registers to simulate a safe k-valued register in which the read algorithm takes the optimal number of steps (log_2 k), the write algorithm must take at least log k steps in the worst case. A fortiori, the same lower bound applies when the simulated register should be regular. Previously known algorithms show that both these lower bounds are tight. We also show that in order to simulate an atomic k -valued register for two readers, the optimal number of steps for the read algorithm must be strictly larger than log_2 k. 
    more » « less
    Full Text Available