Abstract
We present the first NC algorithm for scheduling n unit length tasks on m identical processors for the case where the precedence constraint is an interval order. Our algorithm runs on a priority CRCW PRAM in O(log2 n) time with O(n 5) processors, or in O(log3 n) time with O(n 4) processors. The algorithm constructs the same schedule as the one produced by the sequential algorithm (list scheduling). On the other hand, we show that when the precedence constraints are allowed to be arbitrary, the construction of the list schedule is P-complete.
Research supported in part by NSF grant CCR-9011214
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. D. Ullman. Complexity of sequencing problems. In E. G. Coffman, editor, Computer and Job Scheduling Theory. John Wiley and sons, 1976.
E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200–213, 1971.
M. R. Garey and D. S. Johnson. Scheduling tasks with nonuniform deadlines on two processors. Journal of the ACM, 23:461–467, 1976.
H. N. Gabow. An almost linear time algorithm for two processor scheduling. J. Assoc. Comput. Mach., 29:766–780, 1982.
M. Bartusch, R. H. Mohring, and F. J. Radermacher. M-machine unit time scheduling: a report of ongoing research, volume 304 of Lecture Notes in Economics and Mathematical Systems, pages 165–212. Springer-Berlin, 1988.
T. C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9:841–848, 1961.
C. H. Papadimitriou and M. Yannakakis. Scheduling interval-ordered tasks. SIAM J. on Computing, 8:405–409, 1979.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. Technical report, Centrum voor Wiskunde en Informatica, 1989.
D. Helmbold and E. Mayr. Fast Scheduling Algorithms on Parallel Computers. Advances in Computing Research. Jai press inc., London, 1987.
D. HelmBold and E. Mayr. Two processor scheduling is in NC. SIAM J. on Computing, 16:747–759, August 1987.
H. Jung, P. Spirakis, and M. Serna. A parallel algorithm for two processors precedence constrained scheduling. In Proceedings of ICALP, 1991.
D. Dolev, E. Upfal, and M. Warmuth. Scheduling trees in parallel. In P. Bertolazzi and F. Luccio, editors, VLSI: Algorithms and Architectures, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sunder, S., He, X. (1993). Scheduling interval ordered tasks in parallel. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive