Unifying Concurrent Objects and Distributed Tasks

DOI10.1145/3266457MaRDI QIDQ4625665zbMATH OpenOpenAlexWikidataFDO

Authors Armando Castañeda, Sergio Rajsbaum, Michel Raynal

Publication date 25 February 2019

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3266457

zbMATH Keywords

concurrencydistributed algorithmnondeterminismasynchronous systemprocess crashlinearizabilityconcurrent objectsequential specificationdistributed taskobject composabilityset-linearizability

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1304382
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• Concurrent specifications beyond linearizability
• scientific article; zbMATH DE number 1546500
• From bounded to unbounded concurrency objects and back
• A separation logic for refining concurrent objects
• A calculus for concurrent objects
• On the inherent sequentiality of concurrent objects
• Unifying Semantics for Concurrent Programming

Cited in

(19)

• Local linearizability for concurrent container-type data structures
• Intermediate value linearizability: a quantitative correctness criterion
• Presenting interval pomsets with interfaces
• Asynchronous wait-free runtime verification and enforcement of linearizability
• Tasks in modular proofs of concurrent algorithms
• Locally solvable tasks and the limitations of valency arguments
• Relaxed queues and stacks from read/write operations
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• About informatics, distributed computing, and our job: a personal view
• scientific article; zbMATH DE number 1304382 (Why is no real title available?)
• Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• Agreeing within a few writes
• Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
• A Sound Foundation for the Topological Approach to Task Solvability
• Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
• A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
• Tasks in modular proofs of concurrent algorithms
• Intermediate value linearizability: a quantitative correctness criterion

This page was built for publication: Unifying Concurrent Objects and Distributed Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625665)