Advertisement

Journal of Scheduling

, Volume 18, Issue 6, pp 561–573 | Cite as

Real-time scheduling to minimize machine busy times

  • Rohit Khandekar
  • Baruch Schieber
  • Hadas Shachnai
  • Tami Tamir
Article

Abstract

Consider the following scheduling problem. We are given a set of jobs, each having a release time, a due date, a processing time, and demand for machine capacity. The goal is to schedule all jobs non-preemptively in their release-time deadline windows on machines that can process multiple jobs simultaneously, subject to machine capacity constraints, with the objective to minimize the total busy time of the machines. Our problem naturally arises in power-aware scheduling, optical network design, and customer service systems, among others. The problem is APX-hard by a simple reduction from the subset sum problem. A main result of this paper is a 5-approximation algorithm for general instances. While the algorithm is simple, its analysis involves a non-trivial charging scheme which bounds the total busy time in terms of work and span lower bounds on the optimum. This improves and extends the results of Flammini et al. (Theor Comput Sci 411(40–42):3553–3562, 2010). We extend this approximation to the case of moldable jobs, where the algorithm also needs to choose, for each job, one of several processing-time versus demand configurations. Better bounds and exact algorithms are derived for several special cases, including proper interval graphs, intervals forming a clique and laminar families of intervals.

Keywords

Real-time scheduling Power-aware  Minimum total busy time Approximation algorithms 

Notes

Acknowledgments

We thank Dor Arad for helpful discussions on an earlier version of the paper. We are also grateful to the two anonymous referees for valuable comments and suggestions. Work partially supported by funding for DIMACS visitors.

References

  1. Bar-Yehuda, R., Bar-Noy, A., Freund, A., Naor, J., & Schieber, B. (2000). A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 1–23.Google Scholar
  2. Belede, L., Jain, A., & Reddy Gaddam, R. (2009). Unit commitment with nature and biologically inspired computing. In World congress on nature and biologically inspired computing (NABIC) (pp. 824–829).Google Scholar
  3. Bhatia, S., Chuzhoy, J., Freund, A., & Naor, J. (2007). Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms, 3(1).Google Scholar
  4. Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.Google Scholar
  5. Calinescu, G., Chakrabarti, A., Karloff, H., & Rabani, Y. (2011). An improved approximation algorithms for resource allocation. ACM Transactions on Algorithms, 7(4), 1–7.CrossRefGoogle Scholar
  6. Chang, J., Khuller, S., & Mukherjee, K. (2014). LP rounding and combinatorial algorithms for minimizing active and busy time. In 26th ACM symposium on parallelism in algorithms and architectures (SPAA).Google Scholar
  7. Chen, B., Hassin, R., & Tzur, M. (2002). Allocation of bandwidth and storage. IIE Transactions, 34, 501–507.Google Scholar
  8. Edmonds, J. (1965). Paths, trees and flowers. Canadian Journal of Mathematics, 17, 449–467.CrossRefGoogle Scholar
  9. Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., et al. (2010). Minimizing total busy time in parallel scheduling with application to optical networks. Theoretical Computer Science, 411(40–42), 3553–3562.CrossRefGoogle Scholar
  10. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., & Zaks, S. (2008). Approximating the traffic grooming problem with respect to ADMs and OADMs. In 14th Euro-Par.Google Scholar
  11. Gerstel, O., Ramaswami, R., & Sasaki, G. (1998). In INFOCOM: Sasaki. Cost effective traffic grooming in wdm rings.Google Scholar
  12. Kang, J., Ranka, S. (2008). Energy-efficient dynamic scheduling on parallel machines. In High performance computing (HiPC) (pp. 208–219).Google Scholar
  13. Khandekar, R., Schieber, B., Shachnai, H., Tamir, T. (2010) Minimizing busy time in multiple machine real-time scheduling. In Foundations of software technology and theoretical computer science (FSTTCS) (pp. 169–180).Google Scholar
  14. Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2), 331–342.CrossRefGoogle Scholar
  15. Lawler, E., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. (1993). Sequencing and scheduling: Algorithms and complexity. In: S. C. Graves, A. H. G. Rinnooy Kan, P. Zipkin (Eds.). Handbooks in operations research and management science (Vol. 4).Google Scholar
  16. Leung, J. Y.-T. (Ed.). (2004). Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton, FL: CRC Press.Google Scholar
  17. Ludwig, W. T. (1995). Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis, Dept. of Computer Science, Univ. of Wisconsin - Madison.Google Scholar
  18. Manzak, A., & Chakrabarti, C. (2003). Variable voltage task scheduling algorithms for minimizing energy/power. IEEE Transaction on VLSI Systems, 11(2), 501–507.CrossRefGoogle Scholar
  19. Mertzios, G. B., Shalom, M., Voloshin, A., Wong, P. W. H., & Zaks, S. (2012). Optimizing busy time on parallel machines. In IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 238–248).Google Scholar
  20. Phillips, C. A., Uma, R. N., & Wein, J. (2000). Off-line admission control for general scheduling problems. Journal of Scheduling, 3, 365–381.CrossRefGoogle Scholar
  21. Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems. Berlin: Springer.Google Scholar
  22. Schwarz, U. M. (2009). Tightness results for malleable task scheduling algorithms. In Parallel processing and applied mathematics.Google Scholar
  23. Turek, J., Wolf, J. L., & Yu, P. S. (1992) Approximate algorithms for scheduling parallelizable tasks. In 4th ACM symposium on parallel algorithms and architectures (SPAA).Google Scholar
  24. Vasić, N., Barisits, M., Salzgeber, V., Kostić, D. (2009). Making cluster applications energy-aware. In 1st workshop on automated control for datacenters and clouds (ACDC).Google Scholar
  25. Winkler, P., Zhang, L. (2003). Wavelength assignment and generalized interval graph coloring. In 14th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 830–831).Google Scholar
  26. Wood, A. J., & Wollenberg, B. (1996). Power generation operation and control (2nd ed.). New York: Wiley.Google Scholar
  27. Zhang, Y., Hu, X., Chen, D. Z. (2002). Task scheduling and voltage selection for energy minimization. In Design automation conference (DAC) (pp. 183–188).Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Rohit Khandekar
    • 1
  • Baruch Schieber
    • 2
  • Hadas Shachnai
    • 3
  • Tami Tamir
    • 4
  1. 1.Knight Capital GroupJersey CityUSA
  2. 2.IBM T.J. Watson Research CenterYorktown HeightsUSA
  3. 3.Computer Science DepartmentTechnionHaifaIsrael
  4. 4.School of Computer ScienceThe Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations