Minimizing mean weighted execution time loss on identical and uniform processors (Q581214)
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: Minimizing mean weighted execution time loss on identical and uniform processors |
scientific article; zbMATH DE number 4018749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing mean weighted execution time loss on identical and uniform processors |
scientific article; zbMATH DE number 4018749 |
Statements
Minimizing mean weighted execution time loss on identical and uniform processors (English)
0 references
1987
0 references
The problem of minimizing mean weighted execution time loss is formulated within a real-time process control system framework. The authors propose a strongly polynomial algorithm based on a network flow technique, which minimizes the above criterion for an arbitrary number of identical as well as uniform processors. The upper bounds on the numbers of preemptions in both cases are also given.
0 references
deadlines
0 references
mean weighted execution time loss
0 references
strongly polynomial algorithm
0 references
network flow technique
0 references
