242 search results - page 11 / 49 » Computing bounds for fault tolerance using formal techniques |
137
click to vote
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
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...
ICPP
1993
IEEE
15 years 1 months ago
1993
IEEE
- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subc...
101
click to vote
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
ICDCS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...