| Clustering and Scheduling Method Based on Task Duplication |
| |
| 引用本文： | HE Kun ZHAO Yong. Clustering and Scheduling Method Based on Task Duplication[J]. 武汉大学学报:自然科学英文版, 2007, 12(2): 260-266. DOI: 10.1007/s11859-006-0028-y |
| |
| 作者姓名： | HE Kun ZHAO Yong |
| |
| 作者单位： | Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （7047107） and the Ph.D. Programs Foundation of Ministry of Education of China （20020487046） |
| |
| 摘 要： | A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster＇s priority, and task potentiality for tasks＇ priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.
|
| 关 键 词： | 聚类 有向无圈图 任务调度 任务复制 |
| 文章编号： | 1007-1202（2007）02-0260-07 |
| 收稿时间： | 2006-04-13 |
Clustering and scheduling method based on task duplication |
| |
| He Kun,Zhao Yong. Clustering and scheduling method based on task duplication[J]. Wuhan University Journal of Natural Sciences, 2007, 12(2): 260-266. DOI: 10.1007/s11859-006-0028-y |
| |
| Authors: | He Kun Zhao Yong |
| |
| Affiliation: | (1) Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, 430074, Hubei, China |
| |
| Abstract: | A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster’s priority, and task potentiality for tasks’ priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines. Biography: HE Kun(1972-), female, Ph.D. candidate, research direction: the computer network and parallel computing. |
| |
| Keywords: | clustering directed acyclic graph task duplication task scheduling |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
