Advertisement

Meta-heuristic Task Scheduling Algorithm for Computing Cluster with 2D Packing Problem Approach

  • Wojciech BożejkoEmail author
  • Zenon Chaczko
  • Piotr Nadybski
  • Mieczysław Wodecki
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 761)

Abstract

In this paper we present a mathematical model and an algorithm for solving a task scheduling problem in computing cluster. The problem is considered as a 2D packing problem. Each multi-node task is treated as a set of separate subtasks with common constrains. For optimization the tabu search metaheuristic algorithm is applied.

Notes

Acknowledgement

The paper was partially supported by the National Science Centre of Poland, grant OPUS no. DEC 2017/25/B/ST7 /02181.

References

  1. 1.
    Bozoki, G., Richard, J.-P.: A branch-and-bound algorithm for the continous-process job-shop scheduling problem. AIIE Trans. 2(3), 246–252 (1970)CrossRefGoogle Scholar
  2. 2.
    Błażewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. 35(5), 389–393 (1986)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Błądek, I., Drozdowski, M., Guinand, F., Schepler, X.: On contiguous and non-contiguous parallel task scheduling. J. Sched. 18(5), 487–495 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)CrossRefGoogle Scholar
  5. 5.
    Bożejko, W., Nadybski, P., Wodecki, M.: Scheduling tasks for a computing cluster. In: Knosala, R. (ed.) Innovation in Management and Production Engineering, pp. 524–533. Publishing House of the Polish Society for Production Management (2017). ISBN 978-83-941281-1-1Google Scholar
  6. 6.
    Bożejko, W., Kacprzak, L., Nadybski, P., Wodecki, M.: Multi-machine scheduling with setup times. In: Proceedings of the Computer Information Systems and Industrial Management - 15th International Conference, CISIM 2016, Vilnius, Lithuania, 14–16 September 2016. LNCS, vol. 9842, 300–311. Springer (2016)CrossRefGoogle Scholar
  7. 7.
    Bożejko, W., Nadybski, P., Wodecki, M.: Two step algorithm for virtual machine distributed replication with limited bandwidth problem. In: Proceedings of the Computer Information Systems and Industrial Management - 15th International Conference, CISIM 2016, Vilnius, Lithuania, 14–16 September 2016. LNCS, vol. 9842, 312–321. Springer (2016)CrossRefGoogle Scholar
  8. 8.
    Cao, D., Kotov, V.M.: A best-fit heuristic algorithm for two dimensional bin packing problem. Electr. Mech. Eng. Inf. Technol. (EMEIT) 7, 3789–3791 (2011)CrossRefGoogle Scholar
  9. 9.
    Drozdowski, M.: Scheduling for Parallel Processing. Springer, London (2009)CrossRefGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)zbMATHGoogle Scholar
  11. 11.
    Glover, F.: Tabu search. Part I. ORSA J. Comput. 1, 190–206 (1989)CrossRefGoogle Scholar
  12. 12.
    Imamichi, T., Kenmochi, M., Nonobe, K., Nagamochi, H., Yagiura, M.: Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1), 73–83 (2009)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123, 379–396 (2002)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Lin, J.F., Chen, S.J.: Scheduling algorithm for nonpreemptive multiprocessor tasks. Comput. Math. Appl. 28(4), 85–92 (1994)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Lloyd, E.: Concurrent task systems. Oper. Res. 29(1), 189–201 (1981)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy, March 2001Google Scholar
  17. 17.
    Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1–3), 379–396 (2002)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pietrobuoni, E.: Two-dimensional bin packing problem with Guillotine restrictions, Ph.D., Universit‘a di Bologna (2015)Google Scholar
  19. 19.
    Vizing, V.: About schedules observing deadlines. Kibernetika 1, 128–135 (1981)MathSciNetGoogle Scholar
  20. 20.
    Wodecki, M.: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. J. Adv. Manuf. Technol. 37(9–10), 996–1004 (2007)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Wojciech Bożejko
    • 1
    Email author
  • Zenon Chaczko
    • 2
  • Piotr Nadybski
    • 3
  • Mieczysław Wodecki
    • 4
  1. 1.Department of Automatics, Mechatronics and Control Systems, Faculty of ElectronicsWrocław University of TechnologyWrocławPoland
  2. 2.FEIT Faculty of Engineering and ITUTS University of Technology SydneySydneyAustralia
  3. 3.The Faculty of Technical and Economic ScienceWitelon State University of Applied Sciences in LegnicaLegnicaPoland
  4. 4.Telecommunications and Teleinformatics DepartmentWrocław University of TechnologyWrocławPoland

Personalised recommendations