Unifying Concurrent Objects and Distributed Tasks

DOI10.1145/3266457zbMath1426.68181OpenAlexW2900684180MaRDI QIDQ4625665

Armando Castañeda, Michel Raynal, Sergio Rajsbaum

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

linearizabilityconcurrencynondeterminismdistributed algorithmasynchronous systemprocess crashconcurrent objectsequential specificationdistributed taskobject composabilityset-linearizability

Mathematics Subject Classification ID

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

Related Items (8)

Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Agreeing within a few writes ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ A Sound Foundation for the Topological Approach to Task Solvability

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