东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2005, Vol. 26 ›› Issue (11): 38-40.DOI: -

• 论著 • 上一篇    下一篇

副本定位请求的调度算法

游新冬;常桂然;陈学耀;曾万聃   

  1. 东北大学信息科学与工程学院;东北大学计算中心;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2005-11-15 发布日期:2013-06-24
  • 通讯作者: You, X.-D.
  • 作者简介:-
  • 基金资助:
    高等学校教育博士点专项基金资助项目(20030145017)

Scheduling algorithms for replica location request

You, Xin-Dong (1); Chang, Gui-Ran (2); Chen, Xue-Yao (1); Zeng, Wan-Dan (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Computing Center, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-11-15 Published:2013-06-24
  • Contact: You, X.-D.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

520

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

关键词: 副本定位, 排队论, DHT, 数据网格, 网格计算, 任务调度

Abstract: 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 local abilities of the home nodes in the former are both the same to those in the later and, local abilities 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.

中图分类号: