At-Most-Once Semantics in Asynchronous Shared Memory
From MaRDI portal
Publication:3646230
DOI10.1007/978-3-642-04355-0_27zbMath1261.68029OpenAlexW1656875281MaRDI QIDQ3646230
Nicolas Nicolaou, Aggelos Kiayias, Sotirios Kentros, Alexander A. Schwarzmann
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_27
Related Items (4)
Solving the at-most-once problem with nearly optimal effectiveness ⋮ The assignment problem ⋮ Doing-it-all with bounded work and communication ⋮ Online parallel scheduling of non-uniform tasks: trading failures for energy
This page was built for publication: At-Most-Once Semantics in Asynchronous Shared Memory
