Counterexample to a Conjecture of Fujii, Kasami and Ninomiya.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
In a recent paper, Fujii, Kasami and Ninomiya presented a procedure for the optimal scheduling of a system of unit length tasks represented as a directed acyclic graph on two identical processors. The authors conjecture that the algorithm can be extended to the case where more than two processors are employed. The note presents a counterexample to that conjecture. Author
- Operations Research