副本定位请求的调度算法

Scheduling Algorithms for Replica Location Request

针对数据网格中各个网格节点的异构性等特点,提出了基于FCFS和“能者多劳”相结合的调度方法,在假设条件副本定位请求的产生速率相同以及所有宿主节点的定位能力总和相同成立的情况下,假设各个宿主节点之间的定位能力成等比数列.利用Java程序对系统模拟,模拟实验结果表明:系统在采用基于FCFS和“能者多劳”相结合的调度方法时,相比于采用M/M/N模型中基于FCFS的调度方法,能够使系统平均响应时间等多个性能参数得到改善.

According to the heterogeneous characteristics of the data grid nodes, a scheduling algorithm based on FCFS and the idea ＂able person should do more work＂ is proposed. The simulation experiments using Java program showed that when employing this scheduling algorithm the simulation system performs better than employing the scheduling algorithm based only on FCFS in the M/M/N queuing model if the rate generating of the replica location requests and the total locatabilities of the home nodes in the former are both the same to those in the later and, locatabilities among all home nodes are in geometrical series. The algorithm proposed will therefore improve several performance parameters in the simulated system, such as the average response time of replica location requests.