282 search results - page 12 / 57 » Reliability and Scheduling on Systems Subject to Failures |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
Supercomputing systems must be able to reliably and efficiently complete their assigned workloads, even in the presence of failures. This paper proposes a system that allows the ...
TECS
2010
14 years 8 months ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
CODES
2007
IEEE
15 years 4 months ago
2007
IEEE
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
SOSP
2005
ACM
15 years 6 months ago
2005
ACM
Commodity file systems trust disks to either work or fail completely, yet modern disks exhibit more complex failure modes. We suggest a new fail-partial failure model for disks, ...