Skip to main content
SpringerLink
Log in

Scheduling semi-malleable jobs to minimize mean flow time

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

This paper deals with the problem of scheduling \(n_\mathrm{A}\) malleable and \(n_\mathrm{B}\) non-malleable jobs to be executed together on two parallel identical machines to minimize mean flow time. We propose a set of dominant schedules for this problem, and a dynamic programming algorithm that finds an optimal schedule in this dominant set in time \(O(n_\mathrm{A}^2n_\mathrm{B})\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Amoura, A., Bampis, E., Kenyon, C., & Manoussakis, I. (2002). Scheduling independent multiprocessor tasks. Algorithmica, 32(2), 247–261.

    Article  Google Scholar 

  • Blayo, E., Debreu, L., Mounié, G., & Trystram, D. (2000). Dynamic load balancing for adaptive mesh ocean circulation model. Engineering Simulations, 22, 8–24.

    Google Scholar 

  • Blazewicz, J., Kovalyov, M. Y., Machowiak, M., Trystram, D., & Weglarz, J. (2006). Preemptable malleable task scheduling problem. IEEE Transactions on Computers, 55, 486–490.

    Article  Google Scholar 

  • Buisson, J., Sonmez, O., Mohamed, H., Lammers, W., & Epema, D. (2007). Scheduling malleable applications in multicluster systems. In IEEE International Conference on Cluster Computing (pp. 372–381).

  • Drozdowski, M., & Dell’Olmo, P. (2000). Scheduling multiprocessor tasks for mean flow time criterion. Computers and OR, 27, 571–585.

    Article  Google Scholar 

  • Dutot, P. -F., Eyraud, L., Mounié, G., & Trystram, D. (2004a). Bi-criteria algorithm for scheduling jobs on cluster platforms. In 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 125–132).

  • Dutot, P. -F., Mounié, G., & Trystram, D. (2004b). Chapter 26, scheduling parallel tasks—Approximation algorithms. In Handbook of scheduling. Boca Raton: CRC press.

  • Feitelson, D., & Rudolph, L. (1990). Distributed hierarchical control for parallel processing. IEEE Transactions on Computers, 23, 65–77.

    Google Scholar 

  • Hendel, Y., & Kubiak, W. (2008). Minimizing mean flow time for the two machines semimalleable jobs scheduling problem. In F. Serifoglu & Ü. Bilge (Eds.), Abstracts of the 11th Internat. Workshop on Project Management and Scheduling (pp. 136–140).

  • Lee, C. Y., & Cai, X. (1999). Scheduling one and two processor tasks on two parallel processors. IIE Transactions, 31(5), 445–455.

    Google Scholar 

  • Ludwig, W. T. (1995). Algorithms for scheduling malleable and non-malleable parallel tasks. Ph.D. thesis, University of Wisconsin-Madison.

  • Ludwig, W. T., & Tiwari, P. (1994). Scheduling malleable and non-malleable parallel tasks. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (pp. 167–176).

  • Sadykov, R. (2012). A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. Computers and OR, 39, 1265–1270.

    Article  Google Scholar 

  • Turek, J., Wolf, J. L., & Yu, P. S. (1992). Approximate algorithms scheduling parallelizable tasks. In 14th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 323–332).

Download references

Acknowledgments

This research of Yann Hendel and Wieslaw Kubiak has been supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant OPG0105675. The research of Wieslaw Kubiak has also been supported by the University Joseph Fourier, Grenoble.

Author information

Authors and Affiliations

  1. Memorial University, St. John’s, NL, Canada

    Yann Hendel & Wieslaw Kubiak

  2. Grenoble Institute of Technology and The Institute Universitaire de France, Grenoble, France

    Denis Trystram

Authors
  1. Yann Hendel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wieslaw Kubiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Denis Trystram
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Denis Trystram.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hendel, Y., Kubiak, W. & Trystram, D. Scheduling semi-malleable jobs to minimize mean flow time. J Sched 18, 335–343 (2015). https://doi.org/10.1007/s10951-013-0341-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0341-1

Keywords

Search

Navigation