most citedSolving the At-Most-Once Problem with Nearly Optimal Effectiveness

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2011★ 3 cited

Solving the At-Most-Once Problem with Nearly Optimal Effectiveness

Sotirios Kentros, Aggelos Kiayias

We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m shared-memory fail-prone processes perform asynchronously n jobs at most once…