Accession Number : AD0749848

Title :   Counterexample to a Conjecture of Fujii, Kasami and Ninomiya.

Descriptive Note : Technical note,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Kaufman,Marc T.

Report Date : JUN 1972

Pagination or Media Count : 6

Abstract : 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)

Descriptors :   (*DATA PROCESSING, SCHEDULING), ALGORITHMS, OPTIMIZATION, MULTIPLE OPERATION, GRAPHICS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE