Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-10-04
International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol.2, No.3,
Computer Science
Distributed, Parallel, and Cluster Computing
11 pages, 7 figures
Scientific paper
10.5121/jgraphoc.2010.2302
In data-intensive applications data transfer is a primary cause of job execution delay. Data access time depends on bandwidth. The major bottleneck to supporting fast data access in Grids is the high latencies of Wide Area Networks and Internet. Effective scheduling can reduce the amount of data transferred across the internet by dispatching a job to where the needed data are present. Another solution is to use a data replication mechanism. Objective of dynamic replica strategies is reducing file access time which leads to reducing job runtime. In this paper we develop a job scheduling policy and a dynamic data replication strategy, called HRS (Hierarchical Replication Strategy), to improve the data access efficiencies. We study our approach and evaluate it through simulation. The results show that our algorithm has improved 12% over the current strategies.
Abdi Somayeh
Mohamadi Somayeh
Pedram Hossein
No associations
LandOfFree
The Impact of Data Replicatino on Job Scheduling Performance in Hierarchical data Grid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Impact of Data Replicatino on Job Scheduling Performance in Hierarchical data Grid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Impact of Data Replicatino on Job Scheduling Performance in Hierarchical data Grid will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-274573