A fault-tolerant scheduling problem (Q3751355)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fault-tolerant scheduling problem |
scientific article; zbMATH DE number 3989086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fault-tolerant scheduling problem |
scientific article; zbMATH DE number 3989086 |
Statements
A fault-tolerant scheduling problem (English)
0 references
1986
0 references
real-time systems
0 references
software reliability
0 references
deadlines
0 references
two modes of processing
0 references
fault-tolerant computer systems
0 references
polynomial time
0 references
0.7799861431121826
0 references
0.7756854891777039
0 references
0.764305055141449
0 references
0.763775646686554
0 references
