Increasing performance in Data grid by a new replica replacement algorithm

Subject Areas : B. Computer Systems Organization

Mahsa Beigrezaei ¹ , Abolfazl Toroghi Haghighat ² , Seyedeh Leili Mirtaheri ³ , Narges Hajizadeh Bastani ⁴

1 - Department of Computer and Engineering, Yadegar -e- Imam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Shahr-e-Rey, Iran
2 - Department of Computer and Engineering, Yadegar -e- Imam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Shahr-e-Rey, Iran
3 - Computer Engineering Department, Kharazmi University, Tehran, Iran
4 - Department of Computer and Engineering, Yadegar -e- Imam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Shahr-e-Rey, Iran

Received: 2020-09-21 Accepted : 2020-09-21 Published : 2020-05-01

Keywords: Data Grid, Data Replication, replica replacement,

Abstract :

Data Grid provides sharing services for very large data around the world. Data replication is one of the most effective approaches to reduce access latency and response time. In addition to the benefits, replication has costs such as storage and bandwidth consumption, especially when storage space is low and limited. Therefore, the data replacement should be done wisely. In this paper, we proposed a replacement method called FRA. The algorithm defines a weight for each replica that represents its value. This algorithm uses this weight to prevent the removal of valuable replicas. The results demonstrated that FRA algorithm has better performance than other replication methods in terms of the number of replications, the percentage of storage used, and the job execution time.