![]() |
Volumn 2076 LNCS, Issue , 2001, Pages 862-874
|
The buffer minimization problem for multiprocessor scheduling with conflicts
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION ALGORITHMS;
AUTOMATA THEORY;
MULTIPROCESSING SYSTEMS;
POLYNOMIAL APPROXIMATION;
SCHEDULING;
ALGORITHMS;
COMPUTATIONAL LINGUISTICS;
BUFFER MINIMIZATION;
COMPETITIVE ALGORITHMS;
COMPETITIVE RATIO;
COMPLETE K-PARTITE GRAPHS;
MULTI PROCESSOR SCHEDULING;
MULTI PROCESSOR SYSTEMS;
POLYNOMIAL-TIME ALGORITHMS;
PROCESSING TIME;
TASK EXECUTIONS;
TREES (MATHEMATICS);
|
EID: 84857732838
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-48224-5_70 Document Type: Conference Paper |
Times cited : (31)
|
References (9)
|