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.
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Report
%1 Borowsky97thebg
%A Borowsky, Elizabeth
%A Gafni, Eli
%A Lynch, Nancy
%A Rajsbaum, Sergio
%A Universitaria, Ciudad
%D 1997
%K distributed faulttolerant ioautomata reduction simulation
%T The BG Distributed Simulation Algorithm
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8108
%X 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.
@techreport{Borowsky97thebg,
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.},
added-at = {2009-11-13T18:23:52.000+0100},
author = {Borowsky, Elizabeth and Gafni, Eli and Lynch, Nancy and Rajsbaum, Sergio and Universitaria, Ciudad},
biburl = {https://www.bibsonomy.org/bibtex/2df071db1ff2d0c6a972c7907859fe93f/giuliano.losa},
description = {The BG Distributed Simulation Algorithm},
institution = {Distributed Computing},
interhash = {9217ceebf92c2b4c3980fa4917109fe4},
intrahash = {df071db1ff2d0c6a972c7907859fe93f},
keywords = {distributed faulttolerant ioautomata reduction simulation},
timestamp = {2009-11-13T18:23:52.000+0100},
title = {The BG Distributed Simulation Algorithm},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8108},
year = 1997
}