版权说明 操作指南
首页 > 成果 > 详情

Task matching and scheduling by using self-adjusted genetic algorithms

认领
导出
Link by 万方会议论文
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Zhu, Changwu*;Dai, Shangping;Liu, Zhi
通讯作者:
Zhu, Changwu
作者机构:
[Zhu, Changwu; Dai, Shangping] Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
[Liu, Zhi] Junxie Shiguan Sch, Dept Comp Sci, Wuhan 400084, Peoples R China.
通讯机构:
[Zhu, Changwu] H
Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Genetic algorithm;grid computing;task scheduling
期刊:
PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, VOLS 1 AND 2
年:
2006
卷:
2
页码:
908-911
会议名称:
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
会议论文集名称:
第五届认知信息国际会议
会议时间:
2006-07-17
会议地点:
北京
会议赞助商:
中国人工智能学会
机构署名:
本校为第一且通讯机构
院系归属:
计算机学院
摘要:
Gird computing is a new computing-framework to meet the growing computational demands. Grid computing provides mechanisms for sharing and accessing large and heterogeneous collections of remote resources. However, how to scheduling the subtasks in these heterogeneous resources is a critical problem. This paper puts forward a task scheduling algorithm based on genetic algorithm. It first generates a fitness function through weighted least connection algorithm, and than generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc. It approaches op...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com