Optimal scheduling for two-processor systems
- 378 Downloads
Despite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processors. In this paper we formulate a general model of computation structures and exhibit an efficient algorithm for finding optimal nonpreemptive schedules for these structures on two-processor systems. We prove that the algorithm gives optimal solutions and discuss its application to preemptive scheduling disciplines.
Unable to display preview. Download preview PDF.
- 1.Fulkerson, D. R.: Scheduling in project networks. Proc. IBM Scientific Computing Symposium on Combinatorial Problems. New York: IBM Corporation 1966.Google Scholar
- 2.Clark, W.: The Gantt chart (3rd Edition). London: Pitman and Sons 1952.Google Scholar
- 3.Hu, T. C.: Parallel sequencing and assembly line problems. Operations Research 9, No. 6 (Nov. 1961).Google Scholar
- 4.Muntz, R. R., Coffman, E. G., Jr.: Optimal preemptive scheduling on twoprocessor systems. IEEE Trans. on Computers C 18, No. 11, 1014–1020, Nov. 1969.Google Scholar
- 5.- Scheduling of computations on multiprocessor systems: The preemptive assignment discipline. PhD. Thesis, Electrical Eng. Dept., Princeton University, April 1969.Google Scholar
- 6.Graham, R. L.: Bounds for certain multiprocessing anomalies. BSTJ, Nov. 1966, pp. 1563–1581.Google Scholar
- 7.— Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, No.2, 416–429 (1969).Google Scholar
- 8.Fujii, M., Kasami, T., Ninomiya, K.: Optimal sequence of two equivalent processors. SIAM J. Appl. Math. 17, No. 3, 784–789 (1969).Google Scholar
- 9.— Erratum. SIAM J. Appl. Math. 20, No. 1, 141 (1971).Google Scholar
- 10.Edmonds, J.: Paths, trees and flowers. Canad. J. Math. 17, 449–467 (1965).Google Scholar
- 11.Lawler, E. L. (personal communication).Google Scholar