Abstract
This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coffman, Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14 (1985) 744–780
Cole, R., Ost, K., Schirra, S., Edge-coloring bipartite graphs in O(E logD) time. Combinatorica 21 (2001) 5–12
Dobson, G., Karmarkar, U.S.: Simultaneous resourse scheduling to minimize weighted flow times. Oper. Res. 37 (1989) 592–600
Drozdowski, M.: Scheduling multiprocessor tasks-An overview. Euro. J. Oper. Res. 94 (1996) 215–230
Drozdowski, M., Dell’Olmo, P.: Scheduling multiprocessor tasks for mean flow time criterion. Comp. Oper. Res. 27 (2000) 571–585
Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)
Giaro, K., Kubale, M., MaFlafiejski, M., Piwakowski, K.: Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time. Proc. ETFA’99, Barcelona (1999) 343–347
Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75 (2000) 65–69
Giaro, K., Kubale, M., Piwakowski, K.: Complexity results on open shop scheduling to minimize weighted mean flow time of operations. (in preparation)
Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A., Multicoloring trees. Computing and Combinatorics Conference, Tokyo (1999), Lecture Notes in Computer Science 1627 (1999) 271–280
Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Disc. Appl. Math. 55 (1994) 259–272
Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34 (1985) 869–872
Kubale, M.: The complexity of scheduling independent two-processor tasks on dedicated processors. Inf. Process. Lett. 24 (1987) 141–147
Kubale, M.: Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. Euro. J. Oper. Res. 94 (1996) 242–251
Kubale, M., Piwakowski, K.: A linear algorithm for edge coloring of binomial trees. Disc. Math. 150 (1996) 247–256
Zhou, X., Nishizeki, T.: Algorithms for the cost edge-coloring of tress. Lecture Notes in Computer Science 2108 (2001) 288–297
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giaro, K., Kubale, M., Małafiejski, M., Piwakowski, K. (2002). Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive