ویراساینس.
سند علمی

The Impact of Data Replicatino on Job Scheduling Performance in Hierarchical data Grid

Somayeh Abdi, Hossein Pedram, Somayeh Mohamadi

چکیده

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.

اسناد مشابه

  • The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance

    سند علمی۲۰۰۲JSSPPSu-Hui Chiang, Andrea C. Arpaci-Dusseau, Mary K. Vernon

    This paper addresses the question of whether more accurate requested runtimes can significantly improve highperformance priority backfill policies, for production workloads running on leading edge systems such as the 1500 Origin 2000 system at NCSA or the new TeraGRID. This quest

  • Hierarchical Replication Strategy for Adaptive Scoring Job Scheduling in Grid Computing

    سند علمی۲۰۱۴S.Gomathi Subbu

    Grid technology, which together a number of personal computer clusters with high speed networks, can reach the same computing power as a supercomputer does, also with a minimum cost. However, heterogeneous system is called as grid. Scheduling independent tasks on grid is more dif

  • Network and Data Location Aware Job Scheduling in Grid: Improvement to GridWay Metascheduler

    سند علمی۲۰۱۲Saumesh Kumar, Naveen Kumar

    Grid Computing has enabled us to utilize the unused computing power (CPU cycles) of computers connected to networks (e.g. Internet). Nowadays, there are lots of scientific projects going on in the domain of High Energy Physics (HEP) and Grid infrastructure constitutes the core co

  • Online Hierarchical Job Scheduling on Grids

    سند علمی۲۰۰۸Andrei Tchernykh, Uwe Schwiegelshohn, Ramin Yahyapour, Nikolai Kuzjurin

    In this paper, we address non preemptive online scheduling of parallel jobs on a Grid. The Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated t

  • On-line hierarchical job scheduling on grids with admissible allocation

    سند علمی۲۰۱۰J. SchedulingAndrei Tchernykh, Uwe Schwiegelshohn, Ramin Yahyapour, Nikolai Kuzjurin

    In this paper, we address non-preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated t

  • Performance evaluation and optimization of an adaptive scheduling approach for dependent grid jobs with unknown execution time

    سند علمی۲۰۰۹B. Dhoedt, F. De Turck, P. Demeester

    Most nowadays scheduling algorithms for grids are based on the assumption that the application (job) execution time is known before job run-time. This assumption significantly simplifies job-resource matchmaking, although it has proven to be inapplicable for most real-world appli