This Article 
 Bibliographic References 
 Add to: 
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
September 1989 (vol. 38 no. 9)
pp. 1308-1313
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

[1] D. Bernstein and I. Gertner, "Computing expressions on a pipelined processor with a small number of stages," EE PUB No. 594, Dep. Elec. Eng., Technion, Haifa, Israel, June 1986.
[2] D. Bernstein, J. M. Jaffe, R. Y. Pinter, and M. Rodeh, "Optimal scheduling of arithmetic operations in parallel with memory access," TR 88.136, IBM-Israel Scientif. Cent., May 1985. A preliminary version has appeared in theProc. Twelfth ACM Symp. Principles Programming Languages, Jan. 1985, pp. 325-333.
[3] D. Bernstein, J. M. Jaffe, and M. Rodeh, "Scheduling arithmetic and load operations in parallel with no spilling," inProc. Fourteenth ACM Symp. Priniciples Programming Languages, Jan. 1987, pp. 263-273.
[4] J. Blazewicz, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Scheduling subject to resource constraints: Classification and complexity,"Discrete Appl. Math., vol. 5, pp. 11-24, 1983.
[5] J. Bruno, J. W. Jones, and K. So, "Deterministic scheduling with pipelined processors,"IEEE Trans. Comput., vol. C-29, no. 4, pp. 308-316, Apr. 1980.
[6] E. G. Coffman,Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
[7] D. K. Goyal, "Scheduling processor bound systems," inProc. Sixth Texas Conf. Comput. Syst., 1977.
[8] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[9] R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey,"Discrete Optimization, 1977.
[10] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[11] J. Hennessy and T. Gross, "Postpass Code Optimization of Pipeline Constraints,"ACM Trans. Programming Languages and Systems, Vol. 5, No. 3, New York, July 1983, pp. 422-448.
[12] J. M. Jaffe, "Bounds on the scheduling of typed task systems,"SIAM J. Comput., vol. 9, no. 3, pp. 541-551, Aug. 1980.
[13] P. M. Kogge,The Architecture of Pipelined Computers. New York: McGraw-Hill, 1981.
[14] H. F. Li, "Scheduling trees parallel/pipelined processing environments,"IEEE Trans. Comput., vol. C-26, no. 11, pp. 1101-1112, Nov. 1977.
[15] E. L. Lloyd, "Scheduling task systems with resources," Ph.D dissertation, MIT-LCS-TR-236, May 1980.
[16] C. L. Monma, "Sequencing to minimize the maximum job cost,"Oper. Res., vol. 28, no. 4, pp. 942-951, July 1980.
[17] R. M. Russel, "The CRAY-1 computer system,"Commun. ACM, vol. 21, no. 1, pp. 63-72, Jan. 1978.

Index Terms:
parallel machines; complexity; scheduling problems; pipelined machines; dedicated processors; NP-completeness; polynomial-time algorithm; computational complexity; parallel machines; pipeline processing; scheduling.
D. Bernstein, M. Rodeh, I. Gertner, "On the Complexity of Scheduling Problems for Parallel/Pipelined Machines," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1308-1313, Sept. 1989, doi:10.1109/12.29469
Usage of this product signifies your acceptance of the Terms of Use.