Dynamic Replication Mechanism in Data Grid Based on a Weighted Priority-based Scheme
By: Gharajeh, Mohammad Samadi
.
Publisher: Tamil Nadu i-manager's 2019Edition: Vol.6(1), Jan-June.Description: 9-18p.Subject(s): Computer EngineeringOnline resources: Click here
In:
i-manager's journal on cloud computing (JCC)Summary: Replication is one of the popular tools to determine the availability degree of resources (e.g., data files) in data grids. Since data grids involve limited file storages and high computing costs, replication process is very essential in these networks. This paper proposes a dynamic replication mechanism in a data grid that uses a weighted priority-based replication scheme, called WPRS. It specifies a value for existing each in a local storage based on three parameters including price, number of access time, and present time. When a resource is not available for a desired job, it is hired from other sites in the network. The proposed mechanism removes the file having the least value to increase the free space of data storage. Simulation results show that the proposed replication mechanism surpasses some of the existing replication methods in terms of the number of successful jobs, number of non successful jobs, and buy price.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2019875 |
Replication is one of the popular tools to determine the availability degree of resources (e.g., data files) in data grids. Since data grids involve limited file storages and high computing costs, replication process is very essential in these networks. This paper proposes a dynamic replication mechanism in a data grid that uses a weighted priority-based replication scheme, called WPRS. It specifies a value for existing each in a local storage based on three parameters including price, number of access time, and present time. When a resource is not available for a desired job, it is hired from other sites in the network. The proposed mechanism removes the file having the least value to increase the free space of data storage. Simulation results show that the proposed replication mechanism surpasses some of the existing replication methods in terms of the number of successful jobs, number of non successful jobs, and buy price.
Click on an image to view it in the image viewer
There are no comments for this item.