Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29469
The problem of optimal scheduling of a job system for two dedicated processors is presented. A machine model with two functional units which can be either sequential or pipelined is considered. The complexity of optimal scheduling for a set of expressions on such machines is investigated. Some previous NP-completeness results are reviewed and several new ones are presented. For one restricted c
parallel machines; complexity; scheduling problems; pipelined machines; dedicated processors; NP-completeness; polynomial-time algorithm; computational complexity; parallel machines; pipeline processing; scheduling.
M. Rodeh, I. Gertner and D. Bernstein, "On the Complexity of Scheduling Problems for Parallel/Pipelined Machines," in IEEE Transactions on Computers, vol. 38, no. , pp. 1308-1313, 1989.