A new Replica Placement Algorithm in Data Grid
Replica placement is one of the important factors to improve performance in data grid systems. A good replica placement algorithm can result in good performance gains. It should be mentioned that, these algorithms or strategies are dependent on architecture of the data grid. By considering different kinds of architecture in data grid systems, a true representation of a grid is a general graph. So we propose a new algorithm for suitable placement of replicas on graph-based data grids. The performance of the proposed algorithm is improved by minimizing the data access time, avoiding unnecessary replications and nice performance in balancing the load of replica servers. The algorithm will be simulated using a data grid simulator Optorsim, developed by European Data Grid projects.
Keywords: Grid, Data Grid, graph-based topology, Replica Placement, Data Replication.
Download Full-Text
ABOUT THE AUTHORS
Zeinab Fadaie
Received her B.S. in computer engineering from center branch of IAU University, Tehran, in 2008; she is currently pursuing her M.S. degree in the Department of Computer and Mechatronics Engineering at the IAU University. Her area of interests includes distributed computing, computer networks and communications, heterogeneous system and grid computing.
Amir Masoud Rahmani
received his B.S. in computer engineering from Amir Kabir University, Tehran, in 1996, the M.S. in computer engineering from Sharif University of technology, Tehran, in 1998 and the PhD degree in computer engineering from IAU University, Tehran, in 2005. He is assistant professor in the Department of Computer and Mechatronics Engineering at the IAU University. He is the author/co-author of more than 80 publications in technical journals and conferences. He served on the program committees of several national and international conferences. His research interests are in the areas of distributed systems, scheduling algorithms and evolutionary computing.
Zeinab Fadaie
Received her B.S. in computer engineering from center branch of IAU University, Tehran, in 2008; she is currently pursuing her M.S. degree in the Department of Computer and Mechatronics Engineering at the IAU University. Her area of interests includes distributed computing, computer networks and communications, heterogeneous system and grid computing.
Amir Masoud Rahmani
received his B.S. in computer engineering from Amir Kabir University, Tehran, in 1996, the M.S. in computer engineering from Sharif University of technology, Tehran, in 1998 and the PhD degree in computer engineering from IAU University, Tehran, in 2005. He is assistant professor in the Department of Computer and Mechatronics Engineering at the IAU University. He is the author/co-author of more than 80 publications in technical journals and conferences. He served on the program committees of several national and international conferences. His research interests are in the areas of distributed systems, scheduling algorithms and evolutionary computing.
