移动网格可分任务调度研究  

Divisible Task Scheduling in Mobile Grid

作　　者：鞠宏军[1] 杜丽娟[2] 

机构地区：[1]华北科技学院计算机学院,北京101601 [2]华北科技学院电信学院,北京101601

出　　处：《微电子学与计算机》2012年第8期62-65,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(60872055);中央高校基本科研业务费专项资助项目(DX1208B)

摘　　要：解决独立、等长度任务在性能异构且随时间动态变化的一组固定和移动资源上的调度问题,其中移动设备具有间歇连接性.提出动态循环调度DCS算法,用环结构组织任务,调度过程体现了重调度策略和复制策略.对算法进行性能分析和实验验证,表明算法性能和移动资源的间歇连接特征、任务运行跨度、移动资源数量、任务长度等因素相关.Scheduling problem of independent tasks with same length on a group of fixed and mobile resources is studied. These resources are heterogeneous and dynamic in performance and mobile devices with intermittent connectivity. Dynamic circulation scheduling algorithm （DCS） is proposed in which tasks are organized in ring structure and schedule process reflects re-scheduling strategy as well as replication strategy. Performance analysis and experimental verification of DCS are provided, showing that algorithm performance is related to communication environment, tasks span, the number of mobile resources and task length.

关 键 词：移动网格 异构资源 动态性能 调度 可分任务 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]