کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
433045 689217 2013 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Enhanced Dynamic Hierarchical Replication and Weighted Scheduling Strategy in Data Grid
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Enhanced Dynamic Hierarchical Replication and Weighted Scheduling Strategy in Data Grid
چکیده انگلیسی

The Data Grid provides massive aggregated computing resources and distributed storage space to deal with data-intensive applications. Due to the limitation of available resources in the grid as well as production of large volumes of data, efficient use of the Grid resources becomes an important challenge. Data replication is a key optimization technique for reducing access latency and managing large data by storing data in a wise manner. Effective scheduling in the Grid can reduce the amount of data transferred among nodes by submitting a job to a node where most of the requested data files are available. In this paper two strategies are proposed, first a novel job scheduling strategy called Weighted Scheduling Strategy (WSS) that uses hierarchical scheduling to reduce the search time for an appropriate computing node. It considers the number of jobs waiting in a queue, the location of the required data for the job and the computing capacity of the sites Second, a dynamic data replication strategy, called Enhanced Dynamic Hierarchical Replication (EDHR) that improves file access time. This strategy is an enhanced version of the Dynamic Hierarchical Replication strategy. It uses an economic model for file deletion when there is not enough space for the replica. The economic model is based on the future value of a data file. Best replica placement plays an important role for obtaining maximum benefit from replication as well as reducing storage cost and mean job execution time. So, it is considered in this paper. The proposed strategies are implemented by OptorSim, the European Data Grid simulator. Experiment results show that the proposed strategies achieve better performance by minimizing the data access time and avoiding unnecessary replication.


► A novel job scheduling algorithm that uses hierarchical structure is proposed.
► A dynamic hierarchical data replication strategy is proposed.
► The proposed strategies have less job execution time in comparison with other strategies.
► The proposed strategies prevent unnecessary creation of replicas.
► The proposed strategies can save bandwidth usage.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Parallel and Distributed Computing - Volume 73, Issue 4, April 2013, Pages 534–543
نویسندگان
, ,