33 search results - page 1 / 7 » Trying Again to Fail-First |
CSCLP
2004
Springer
13 years 10 months ago
2004
Springer
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
CORR
2011
Springer
13 years 8 days ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
Publication
In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processo...
Presentation
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore process...