Solving the at-most-once problem with nearly optimal effectiveness

DOI10.1016/J.TCS.2013.04.017zbMath1294.68040arXiv1107.2990OpenAlexW2963926037MaRDI QIDQ391254

Sotirios Kentros, Aggelos Kiayias

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2990

zbMATH Keywords

deterministic algorithmsdistributed computingI/O automatatask allocationasynchronous shared memoryat-most-once problemwrite-all problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Distributed systems (68M14)

Related Items (3)

Solving the at-most-once problem with nearly optimal effectiveness ⋮ The assignment problem ⋮ Doing-it-all with bounded work and communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the at-most-once problem with nearly optimal effectiveness
• A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
• Symmetric binary B-trees: Data structure and maintenance algorithms
• The communication complexity of distributed task allocation
• Renaming in an asynchronous environment
• Cooperative asynchronous update of shared memory
• At-Most-Once Semantics in Asynchronous Shared Memory
• Impossibility of distributed consensus with one faulty process
• Algorithms for the Certified Write-All Problem
• Distributed 2-Approximation Algorithm for the Semi-matching Problem
• The Strong At-Most-Once Problem
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• Using adaptive timeouts to achieve at-most-once message delivery
• An algorithm for the asynchronous Write-All problem based on process collision
• A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
• A completeness theorem for a class of synchronization objects
• Semi-matchings for bipartite graphs and load balancing
• Automata, Languages and Programming

This page was built for publication: Solving the at-most-once problem with nearly optimal effectiveness