Journal of Northeastern University ›› 2005, Vol. 26 ›› Issue (11): 38-40.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: