Job scheduling for dynamic data replication strategy based on federation data grid systems
Data access latency is one of the important factors of system performance in federated data grid. Effective job scheduling can reduce data transfer time by considering bandwidth and also dispatching a job to where the needed data are present. However, different job scheduling strategies resulted in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/117/1/FH03-FIK-18-17491.jpg http://eprints.unisza.edu.my/117/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Data access latency is one of the important factors of system performance in federated data grid. Effective job scheduling can reduce data transfer time by considering bandwidth and also dispatching a job to where the needed data are present. However, different job scheduling strategies resulted in different access latency. This paper proposes a model of job scheduling for dynamic replication strategy in federated data grid that is known as dynamic replication for federation (DRF). DRF uses the concept of a defined ‘network core area’ (NCA) as the designated schedule area of which a schedule will be focussed. This paper will also highlight how NCA is reallocated if a schedule fails. Results from the simulation using OptorSim show that, the job scheduling for DRF is superior as compared to Optimal Downloading Replication Strategy (ODRS) in terms of data access time and the inter-region communication. |
|---|