22 search results - page 3 / 5 » Fault Tolerance in Message Passing and in Action |
CONCURRENCY
2010
13 years 8 months ago
2010
Over the past decade the number of processors in the high performance facilities went up to hundreds of thousands. As a direct consequence, while the computational power follow th...
JCP
2006
13 years 8 months ago
2006
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
ICDCS
2000
IEEE
14 years 28 days ago
2000
IEEE
To assure dependable onboard evolution, we have developed a methodology called guarded software upgrading (GSU). In this paper, we focus on a low-cost approach to error containmen...
HPDC
2009
IEEE
14 years 3 months ago
2009
IEEE
Long running High Performance Computing (HPC) applications at scale must be able to tolerate inevitable faults if they are to harness current and future HPC systems. Message Passi...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...