The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732)
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: The feasibility of general task systems with precedence constraints on multiprocessor platforms |
scientific article; zbMATH DE number 5607517
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The feasibility of general task systems with precedence constraints on multiprocessor platforms |
scientific article; zbMATH DE number 5607517 |
Statements
The feasibility of general task systems with precedence constraints on multiprocessor platforms (English)
0 references
25 September 2009
0 references
feasibility analysis
0 references
schedulability analysis
0 references
earliest-deadline-first scheduling
0 references
recurrent task models
0 references
resource-augmentation analysis
0 references
0.8999081
0 references
0.8758733
0 references
0.87035924
0 references
0.8701837
0 references
0.8696655
0 references
