Fault-tolerant oblivious assignment with m m slots in synchronous systems
We defined the SOmA problem in a failure-prone environment. We provided an algorithm solving the SOmA problem with up to f f failures. We provided correctness proofs. We provided an analysis of the average latency to get a slot.
failures distributed coordination abstractions secure computations mutual exclusion distributed systems