首页 | 本学科首页   官方微博 | 高级检索  
     检索      

适用于光纤网格的可自适应调度算法
引用本文:梁雪斌,林新华,李明禄.适用于光纤网格的可自适应调度算法[J].华中科技大学学报(自然科学版),2006,34(Z1):83-85.
作者姓名:梁雪斌  林新华  李明禄
作者单位:上海交通大学,计算机科学与工程系,上海,200240
基金项目:中国教育科研网格ChinaGrid项目;国家发改委下一代互联网示范工程资助项目
摘    要:根据光纤传输特性建立光纤网格模型,给予网络资源同计算、存储等网格资源同等的地位,并将数据传输中网络资源的分配考虑进去,从而真实地反映出网络占用对整个工作调度的影响.基于List Scheduling算法描述一种应用于光纤网格上的可自适应的任务调度算法,其中的路由算法通过修改Dijkstra算法而得到.同固定算法的比较结果证明了该可自适应算法的有效性.

关 键 词:光纤网格  任务调度  通信竞争  列表调度
文章编号:1671-4512(2006)S1-0083-03
修稿时间:2006年5月14日

Adaptive scheduling method available on optical grid
Liang Xuebin,Lin Xinhua,Li Minglu.Adaptive scheduling method available on optical grid[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2006,34(Z1):83-85.
Authors:Liang Xuebin  Lin Xinhua  Li Minglu
Abstract:An optical grid model based on the characters of optical network was raised in this paper.In this model,the network resource was granted the same level to be considered as the computation and storage resource.In order to reflect the reality in job scheduling,allocation of network resource for data transfer was taken into consideration.Then,this paper presents a communication contention-aware solution based on the list scheduling to minimize the total execution time for given tasks towards an optical grid,where the router algorithm was modified from Dijkstra route algorithm.Compared to the fix route algorithm,the feasibility and efficiency of the solution proposed was proved.
Keywords:optical grid  task scheduling  communication contention  list scheduling  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号