The research on meta-job scheduling heuristics in heterogeneous environments

Issue title: Artificial Intelligent Techniques and its Applications

Guest editors: Mahalingam Sundhararajan, Xiao-Zhi Gao and Hamed Vahdat Nejad

Article type: Research Article

Authors: Xingbo, Jin^{a; b} | Ju, Wang^{c; d} | Dali, Wang^e | Chunsheng, Fang^{c; d; *}

Affiliations: [a] College of Computer Science and Technology, Jilin University, Changchun, China | [b] The People’s Liberation Army, Huludao, China | [c] Department of Environmental Science, Jilin University, Changchun, China | [d] Key Laboratory of Groundwater Resources and Environment, Ministry of Education, Jilin University, Changchun, China | [e] Oak Ridge National Laboratory, Oak Ridge, TN, USA

Correspondence: [*] Corresponding author. Fang Chunsheng. E-mail: fangcs@jlu.edu.cn.

Abstract: As the core of rational utilization of computing resources, the scheduling algorithm has gained the interest of many researchers. Aimed at meta-job scheduling in heterogeneous environments, this paper puts forward three algorithms: the meta-job scheduling algorithm based on deviation (MaxD-min heuristic), the meta-job scheduling algorithm based on relative deviation (MaxRD-min heuristic), and the Cordwood algorithm (CA). The former two Algorithm are improvements of the classic Min-min algorithm. The latter CA algorithm is a new method that tries to place each building block on the tray with minimal amount of Sufferage. The result of experimenting shows that the three algorithms, in comparison to Min-Min and Max-Min algorithm, can effectively reduce the total span of scheduling (makespan).

Keywords: Makespan, MaxD-min algorithm, MaxRD-min algorithm, CA algorithm

DOI: 10.3233/JIFS-169408

Journal: Journal of Intelligent & Fuzzy Systems, vol. 34, no. 2, pp. 1141-1151, 2018