Sciweavers

1119 search results - page 74 / 224
» Computing in the Presence of Timing Failures
Sort
View
CONCURRENCY
2010
110views more  CONCURRENCY 2010»
13 years 9 months ago
Redesigning the message logging model for high performance
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...
Aurelien Bouteiller, George Bosilca, Jack Dongarra
GI
2005
Springer
14 years 2 months ago
On the Coverage of Proactive Security: An Addition to the Taxonomy of Faults
: Intrusion tolerance is a recent approach to deal with intentional and malicious failures. It combines the research on fault tolerance with the research on security, and relies on...
Timo Warns
ICCS
2005
Springer
14 years 2 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
PADS
1998
ACM
14 years 1 months ago
Fault-Tolerant Distributed Simulation
In traditional distributed simulation schemes, entire simulation needs to be restarted if any of the participating LP crashes. This is highly undesirable for long running simulati...
Om P. Damani, Vijay K. Garg
WAIM
2004
Springer
14 years 2 months ago
A Low-Cost Checkpointing Scheme for Mobile Computing Systems
In distributed computing systems, processes in different hosts take checkpoints to survive failures. For mobile computing systems, due to certain new characteristics conventional d...
Guohui Li, Hongya Wang, Jixiong Chen