检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]宁波大学计算机科学技术研究所,宁波315211 [2]西安交通大学电子与信息工程学院,西安710049
出 处:《电信科学》2013年第11期52-59,65,共9页Telecommunications Science
基 金:浙江省自然科学基金资助项目(No.LY12F02020);宁波市自然科学基金资助项目(No.2012A610066)
摘 要:针对资源节点基于语义相似度聚类的超级节点模式网格,提出了一种面向用户截止时间、费用上限及二者之间偏好参数等QoS参数约束的网格协作型任务调度算法,其中考虑资源的动态性,引入重调度机制。然后,采用价格时延Petri网这一图形与数学工具,对复杂的调度过程进行形式化、层次化建模,增进对调度系统的理解。构建调度模型的可达任务图,分析调度系统的诸如调度时间、费用、吞吐量、负载平衡等重要性能。实例验证调度算法的有效性,分析了需要协调多种类型资源的网格协作型任务的调度过程及调度系统的若干重要特性。研究内容对于指导实际超级节点模式网格系统的开发、部署均具有重要意义。For grid of super-peer model where nodes were clustering together by means of semantic similarity, a compound task scheduling algorithm was proposed which taking users' time deadline, cost limit and the weight parameters between them as QoS requirements. Considering grid nodes were dynamic, the rescheduling mechanism was introduced. Price timed Petri net which was a powerful graphical and mathematical tool was used to formally and hierarchically model grid scheduling, in order to have better understanding about it. Reachable task graph of Petri net model was constructed to analyze scheduling performance, such as scheduling time, cost, throughout capacity and load balance, etc. Effectiveness of the scheduling algorithm was verified by an example, scheduling process of compound tasks which need several types of resources and the system's scheduling performances were analyzed. Related work had great significance on guiding the construction and implement of real grid systems of super-peer model.
关 键 词:网格调度 超级节点 QOS参数 价格时延Petri网
分 类 号:TP274.2[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.223