Abstract
A snapshot shared memory algorithm is presented, allowing a set of f + 1 processes, any f of which may exhibit stopping failures, to "simulate" a larger number n of processes, also with at most f failures.
Users
Please
log in to take part in the discussion (add own reviews or comments).