Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers

Volumn C-35, Issue 5, 1986, Pages 389-393

  Błażewicz, Jacek ^a   Drabowski, Mieczysław ^b   Wȩglarz, Jan ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b Ośrodek Badawczy Zjednoczenia MERA ^*  (Poland)

Author keywords

Complexity analysis; deterministic scheduling; linear programming approach; microprocessor systems; polynomial in time algorithms; preemptive and nonpreemptive schedules; schedule length criterion; scheduling multiprocessor tasks

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - MULTIPROCESSING; MATHEMATICAL PROGRAMMING, LINEAR;

COMPLEXITY ANALYSIS; DETERMINISTIC SCHEDULING; PREEMPTIVE SCHEDULING;

COMPUTERS, MICROCOMPUTER;

EID: 0022717856     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1986.1676781     Document Type: Article

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. A. Avizienis, “Fault tolerance: The survival attribute of digital systems,” Proc. IEEE, vol. 66, no. 10, pp. 1109–1125, 1978.
3. K. R. Baker, Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
4. J. Błażewicz, M. Drabowski, and J. Wȩglarz, “Scheduling independent 2-processor tasks to minimize schedule length,” Inform. Processing Lett., vol. 18, pp. 267–273, 1984.
5. J. Błażewicz and K. Ecker, “A linear time algorithm for restricted bin packing and scheduling problems,” Oper. Res. Lett., vol. 2, no. 2, pp. 80–83, 1983.
6. J. Błażewicz, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Scheduling subject to resource constraints: Classification and complexity,” Discrete Appl. Math., vol. 5, no. 1, pp. 11–24, 1983.
7. E. G. Coffman, Jr., Ed., Computer and Job/Shop Scheduling Theory. New York: Wiley, 1976.
8. M. Dal Cin and E. Dilger, “On the diagnosability of self-testing multiprocessor systems,” Microprocessing Microprogramming, vol. 7, no. 3, pp. 177–184, 1981.
9. M. R. Garey and D. S. Johnson, “Complexity results for multiprocessor scheduling under resource constraints,” SIAM J. Comput., vol. 4, pp. 397–411, 1975.
10. —, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
11. —, “Approximation algorithms for bin packing problems: A survey,” in Analysis and Design of Algorithms in Combinatorial Optimization, G. Ausiello and M. Lucertini, Eds. Vienna, Austria: Springer-Verlag, 1982, pp. 147–172.
12. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling theory: A survey,” Ann. Discrete Math., vol. 5, pp. 287–326, 1979.
13. L. G. Khachian, “A polynomial algorithm for linear programming” (in Russian), Doklady Akad. Nauk USSR, vol. 244, 1093–1096, 1979.
14. E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Recent developments in deterministic sequencing and scheduling: A survey,” in Deterministic and Stochastic Scheduling, M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan, Eds. Dordrecht, The Netherlands: Reidel, 1982, pp. 35–73.
15. H. W. Lenstra, Jr., “Integer programming with a fixed number of variables,” Univ. Amsterdam, The Netherlands, Tech. Rep., 1981.
16. J. K. Lenstra and A. H. G. Rinnooy Kan, “Scheduling theory since 1981: An annotated bibliography,” Mathematisch Centrum, Amsterdam, The Netherlands, Rep. BW 188/83, 1983.
17. R. McNaughton, “Scheduling with deadlines and loss functions,” Management Sci., vol. 12, no. 1, pp. 1–12, 1959.
18. J. Wȩglarz, J. Błażewicz, W. Cellary, and R. Słowinski, “An automatic revised simplex method for constrained resource network scheduling,” ACM Trans. Math. Software, vol. 3, no. 3, pp. 295–300, 1977.