Improving Job Scheduling Performance with Dynamic Replication Strategy in Data Grids
Dealing with a large amount of data in Data Grids makes the requirement for efficient data access more critical. In this paper, we proposed a new approach to replication problem by organizing the data into several data categories that it belongs to. This organizing will help improving placement strategy of data replication. We studied our approach in combination with scheduling issue and evaluating it through simulation. The result shows that our strategy has improved the scheduling performance by 30%.
Unable to display preview. Download preview PDF.
- 2.Cameron, D.G., et al.: Evaluating Scheduling and Replica Optimisation Strategies in OptorSim. In: Grid 2003. Proc. of 4th Int. Workshop on Grid Comput., IEEE-CS Press, Los Alamitos (2003)Google Scholar
- 3.Ranganathan, K., Foster, I.: Decoupling computation and data scheduling in distributed data-intensive applications. In: Proc. of the 11th IEEE Symposium on High Performance Distributed Computing (HPDC) (July 2002)Google Scholar
- 4.Lamehamedi, H., et al.: Simulation of Dynamic Data Replication Strategies in Data Grids. In: HCW 2003. Proc. of 12th Heterogeneous Comput. Workshop, April 2003, IEEE-CS Press, Los Alamitos (2003)Google Scholar
- 6.Chakrabarti, A., Dheepak, R.A., Sengupta, S.: Integration of Scheduling and Replication in Data Grids. In: Bougé, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol. 3296, pp. 375–385. Springer, Heidelberg (2004)Google Scholar