A Global Dynamic Scheduling with Replica Selection Algorithm Using GridFTP

2010 ◽  
Author(s):  
Gui Bingxiang ◽  
Yi Kui
Keyword(s):  
Dynamic Scheduling ◽  
Selection Algorithm ◽  
Global Dynamic ◽  
Replica Selection

A Replica Selection Algorithm in Data Grid

2013 ◽  
Vol 13 (1) ◽  
pp. 32-41
Author(s):  
Lu Zou ◽  
Tinghuai Ma ◽  
Jianzhong Yang
Keyword(s):  
Data Grid ◽  
Selection Algorithm ◽  
Replica Selection

Research on Optimization Method of Real-Time Available Resources for Dynamic Scheduling

2013 ◽  
Vol 427-429 ◽  
pp. 2650-2655
Author(s):  
J.H. Ge ◽  
W.Y. Li ◽  
Y.P. Shi ◽  
T.Q. Duan ◽  
Y.Q. Chen
Keyword(s):  
Real Time ◽  
Dynamic Property ◽  
Optimization Model ◽  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Optimization Method ◽  
Dynamic Feedback ◽  
Resource Information ◽  
Global Dynamic ◽  
Available Resources

Aimed at the real-time request of dynamic scheduling to product resource, an optimization method of parallel dynamic chain real-time available resources was put forward. Proceed from real-time tracing of resource information influencing scheduling tasks dynamic property, established a resource informations real-time tracing back and optimization model, which used module and parallel process mechanism to different kinds of real-time traced back resource information. The mechanism processed global dynamic feedback tracing for every module and optimized available resources primarily, on this basis, graded the primary available resources and gave a real-time candidate resource set. Through one example of one gear production scheduling, the methods validity was tested.

Efficient Management of Fragmented Replica in Data Grids

2012 ◽  
Vol 4 (2) ◽  
pp. 63-70 ◽  
Author(s):  
Chao-Chin Wu ◽  
Lien-Fu Lai ◽  
Jia-Xian Lai
Keyword(s):  
Optimal Solution ◽  
Selection Algorithm ◽  
Data Grids ◽  
Server Selection ◽  
Efficient Management ◽  
Replica Selection ◽  
Retrieval Efficiency ◽  
Simulation Results ◽  
Replication Technique ◽  
Selection Algorithms

Rather than replicating a file completely, Chang et al. proposed a fragmented replication technique to cope with the problem that only partial content of the replica are required in a local application. Furthermore, they also proposed two server selection algorithms for replica retrieval. However, their algorithms do not always find an optimal solution. To address the problem, in this paper, the authors propose a replica selection algorithm to improve the fragmented replica retrieval efficiency in this paper. It is a heuristic considering not only the transmission time but also the number of available servers for each block. Simulation results show that the proposed algorithm can improve the retrieval efficiency up to 12%.

Sign in / Sign up

Export Citation Format

Share Document