检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒲静[1]
机构地区:[1]西华师范大学计算机学院,四川南充637002
出 处:《计算机工程与应用》2008年第12期118-120,138,共4页Computer Engineering and Applications
基 金:西华师范大学科研启动基金(the Scientific Research Foundation of China West Normal University under Grant No.04B068)
摘 要:资源预留能提供保证QoS的网格服务,但提前预留会增加服务请求拒绝率,且产生的资源碎片降低了资源利用率。在预留分类和预留容量等概念定义的基础上,提出了一种基于可分割任务的网格资源预留机制TDR。TDR中,资源预留在多个方向具有可变的灵活度,并在一定的条件下被分割为多个子预留,从而提高系统容纳能力,并描述了相应的接纳控制算法。仿真实验结果表明,提出的机制能有效地减少预留产生的资源碎片和请求拒绝率,增加资源利用率。Resource reservation is an important way for supporting quality of service in grid computing.However,advance reservations can lead to a reduced performance of grid applications,because resource fragments are resulted in while reserving.A new reservation mechanism is proposed in this paper,which is called as Task Dividable based Reservation(TDR).In presented mechanism,resource reservations are very flexible and can transform in all directions,and within limitation of request,a reservation may be divided into small reservations that are defined as sub-reservations,so as to the performance of the network may be increased.The corresponding algorithm of admission control for TDR is presented.Performance studies based on simulations are carried out also,and the results show that the proposed mechanism outperforms existed similar mechanisms in the important performance metrics:call acceptance rate and bandwidth usage.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28