Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processin
DOI: 10.1109/ipps.1998.670009
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms exploiting spare capacity and tasks laxities for fault detection and location in real-time multiprocessor systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Spare-capacity scheduling: In [15], an algorithm was proposed with fault-detection and location capabilities for real-time systems based on the myopic algorithm. The objective of the algorithm was to improve the schedulability and to use the spare capacity of idle processors for fault-detection and location.…”
Section: Related Workmentioning
confidence: 99%
“…Spare-capacity scheduling: In [15], an algorithm was proposed with fault-detection and location capabilities for real-time systems based on the myopic algorithm. The objective of the algorithm was to improve the schedulability and to use the spare capacity of idle processors for fault-detection and location.…”
Section: Related Workmentioning
confidence: 99%