The concurrency hierarchy, and algorithms for unbounded concurrency

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 161-169

  Gafni, E ^a   Merritt, M ^a   Taubenfeld, G ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; SYSTEMS ENGINEERING;

CONCURRENCY HIERARCHY; SHARED MEMORY; WAIT FREE COMPUTATION;

CONCURRENT ENGINEERING;

EID: 0034777645     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/383962.384008     Document Type: Conference Paper

References (19)

1. Atomic snapshots of shared memory
2. Long-lived renaming made adaptive
3. Renaming in an asynchronous environment
4. Adaptive wait-free algorithms for lattice agreement and renaming
5. Adaptive long-lived renaming with read and write operations
6. Polynomial and adaptive long-lived (2k - 1)-renaming
7. Adaptive, wait-free (2k - 1)-renaming
8. Atomic snapshots in O(n log n) operations
9. Long-lived and adaptive collect with applications
10. Shared memory versus message-passing in an asynchronous distributed environment
11. Distributed snapshots: Determining global states of distributed systems
12. Impossibility results for asynchronous PRAM
13. The asynchronous computability theorem for t-resilient tasks
14. The topological structure of asynchronous computability
15. Linearizability: A correctness condition for concurrent objects
16. On uniform protocols
17. Wait-free algorithms for fast, long-lived renaming
18. Speeding Lamport's fast mutual exclusion algorithm
19. Computing with infinitely many processes