Results 201 to 210 of about 15,385 (260)

Fault-tolerant scheduling

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994
Summary: We study fault-tolerant multiprocessor scheduling under the realistic assumption that the occurrence of faults cannot be predicted. The goal in these problems is to minimize the delay incurred by the jobs. Since this is an online problem we use competitive analysis to evaluate possible algorithms.
Bala Kalyanasundaram, Kirk Pruhs
openaire   +1 more source

Designing masking fault-tolerance via nonmasking fault-tolerance

IEEE Transactions on Software Engineering, 1998
Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guarantee as much: it merely guarantees that when faults stop occurring, program executions converge to states from where programs continually (re)satisfy their specification.
Anish Arora, Sandeep S. Kulkarni
openaire   +1 more source

Fault Tolerance

2013
The current trends in technology, fabrication processes, and computing architectures are increasingly pushing towards the design and development of multi-core and many-core systems constituted by a relevant number of relatively low-cost execution resources (e.g., processors and configurable accelerator units) to achieve high performance while ...
AGOSTA, GIOVANNI   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy