skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The research on meta-job scheduling heuristics in heterogeneous environments

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. In conclusion, 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).

Authors:
 [1];  [2]; ORCiD logo [3];  [2]
  1. Jilin University, Changchun (China). College of Computer Science and Technology; The People’s Liberation Army, Huludao (China)
  2. Jilin University, Changchun (China). Department of Environmental Science and Key Laboratory of Groundwater Resources and Environment, Ministry of Education
  3. Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1468073
Grant/Contract Number:  
AC05-00OR22725
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
Journal of Intelligent & Fuzzy Systems
Additional Journal Information:
Journal Volume: 34; Journal Issue: 2; Journal ID: ISSN 1064-1246
Publisher:
IOS Press
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Makespan; MaxD-min algorithm; MaxRD-min algorithm; CA algorithm

Citation Formats

Xingbo, Jin, Ju, Wang, Dali, Wang, and Chunsheng, Fang. The research on meta-job scheduling heuristics in heterogeneous environments. United States: N. p., 2018. Web. doi:10.3233/JIFS-169408.
Xingbo, Jin, Ju, Wang, Dali, Wang, & Chunsheng, Fang. The research on meta-job scheduling heuristics in heterogeneous environments. United States. doi:10.3233/JIFS-169408.
Xingbo, Jin, Ju, Wang, Dali, Wang, and Chunsheng, Fang. Tue . "The research on meta-job scheduling heuristics in heterogeneous environments". United States. doi:10.3233/JIFS-169408. https://www.osti.gov/servlets/purl/1468073.
@article{osti_1468073,
title = {The research on meta-job scheduling heuristics in heterogeneous environments},
author = {Xingbo, Jin and Ju, Wang and Dali, Wang and Chunsheng, Fang},
abstractNote = {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. In conclusion, 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).},
doi = {10.3233/JIFS-169408},
journal = {Journal of Intelligent & Fuzzy Systems},
issn = {1064-1246},
number = 2,
volume = 34,
place = {United States},
year = {2018},
month = {2}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Save / Share: