Title :
Counterexample to a conjecture in multiprocessor scheduling
Author_Institution :
Politecnico di Torino, Istituto di Elettrotecnica, Torino, Italy
Abstract :
A counterexample to a conjecture on an upper bound to the execution time of a graph of tasks by the longest-path scheduling algorithm is presented.
Keywords :
multiprocessing systems; scheduling; execution time; graph of tasks; multiprocessor scheduling; upper bound;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19760190
