Scheduling multiprocessor tasks on three dedicated processors (Q1197982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling multiprocessor tasks on three dedicated processors |
scientific article; zbMATH DE number 92063 |
Statements
Scheduling multiprocessor tasks on three dedicated processors (English)
0 references
16 January 1993
0 references
The authors analyse the problem of scheduling a set of uni- and duo- processor tasks on three dedicated processors. The objective of the problem is to find a schedule with minimum length. The general problem is shown to be strongly NP-hard, which strengthens the best known complexity result. Finally, they present polynomially solvable special cases as well as an approximation algorithm for some hard subproblems.
0 references
parallel processing
0 references
polynomial algorithm
0 references
NP-complete
0 references
resource allocation
0 references
scheduling
0 references
0.9106541
0 references
0.9092454
0 references
0.9002079
0 references
0.88796294
0 references
0.88516396
0 references
0 references
0.8799011
0 references
