Meta-heuristic task scheduling algorithm for computing cluster with 2D packing problem approach
- Publisher:
- Springer
- Publication Type:
- Conference Proceeding
- Citation:
- Advances in Intelligent Systems and Computing, 2019, 761, pp. 74-82
- Issue Date:
- 2019-01-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
Depcos_2018_Boz_et_al.pdf | Published version | 2.72 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© Springer International Publishing AG, part of Springer Nature 2019. 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.
Please use this identifier to cite or link to this item: