Hierarchical Replication Strategy for Adaptive Scoring Job Scheduling in Grid Computing
Gomathi S Subbu and M Nakkeeran. Article: Hierarchical Replication Strategy for Adaptive Scoring Job Scheduling in Grid Computing. IJCA Proceedings on International Conference on Simulations in Computing Nexus ICSCN(2):17-22, May 2014. Full text available. BibTeX
@article{key:article,
author = {S. Gomathi Subbu and M. Nakkeeran},
title = {Article: Hierarchical Replication Strategy for Adaptive Scoring Job Scheduling in Grid Computing},
journal = {IJCA Proceedings on International Conference on Simulations in Computing Nexus},
year = {2014},
volume = {ICSCN},
number = {2},
pages = {17-22},
month = {May},
note = {Full text available}
}
Abstract
Grid technology, which together a number of personal computer clusters with high speed networks, can reach the same computing power as a supercomputer does, also with a minimum cost. However, heterogeneous system is called as grid. Scheduling independent tasks on grid is more difficult. In order to utilize the power of grid completely, we demand an efficient job scheduling algorithm to execute jobs to resources in a 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 construction of huge volumes of data, efficient usage of the Grid resources becomes a significant challenge. In previous work develop the Adaptive Scoring Job Scheduling algorithm (ASJS) for the grid environment. In that algorithm is not suitable for replication technique. 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 between nodes by submitting a job to a node where most of the requested data files are available. The proposed system uses dynamic data replication strategy, called Effective Hierarchical Replication (EHR) 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 node. So our proposed system finds the replicate detection of files with different cluster structure representation of the input files. We combine the replica strategy with ASJS algorithm for efficiently decrease the completion time of submitted jobs, which may consist of computing-intensive jobs and data-intensive jobs.
References
- K. Sashi, A. Thanamani, Dynamic replication in a Data Grid using a modified BHR region based algorithm, Future Generation Computer Systems 27 (2) (2011) 202–210.
- M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, R. Freund, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing system, Journal of Parallel and Distributed Computing 59 (1999) 107–131.
- Sheng-De Wang, I-Tar Hsu, Zheng-Yi Huang, Dynamic scheduling methods for computational grid environment, International Conference on Parallel and Distributed Systems 1 (2005) 22–28.
- E. Salari, K. Eshghi, An ACO algorithm for graph coloring problem, in: Congress on Computational Intelligence Methods and Applications, December 2005, pp. 15–17.
- Hui Yuan, Xue Qin, Ximg Li, Ming-Hui Wu, An improved ant algorithm for job scheduling in gird computing, in: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, vol. 5, 18–21 August, 2005, pp. 2957-2967.
- S. -M. Park, J. -H. Kim, Y. -B. Go, W. -S. Yoon, Dynamic grid replication strategy based on internet hierarchy, in: International Workshop on Grid and Cooperative Computing, in: Lecture Note in Computer Science, vol. 1001, 2003,pp. 1324–1331.
- K. Sashi, A. S. Thanamani, Dynamic replication in a Data Grid using a Modified BHR region based algorithm, Future Generation Computer Systems 27 (2011) 202–210.
- M. Bsoul, A. Khasawneh, E. E. Abdallah, Y. Kilani, Enhanced fast spread replication strategy for Data Grid, Journal of Network and Computer Applications 34 (2011) 575–580.
- K. Ranganathana, I. Foster, Identifying dynamic replication strategies for a high performance Data Grid, in: Proceedings of the International Grid Computing Workshop, 2001, pp. 75–86.
- D. T. Nukarapu, B. Tang, L. Wang, S. Lu, Data replication in data intensive scientific applications with performance guarantee, IEEE Transactions on Parallel and Distributed Systems 22 (2011).
- A. Chervenak, R. Schuler, M. Ripeanu, M. A. Amer, S. Bharathi, I. Foster, C. Kesselman, The globus replica location service: design and experience, IEEE Transactions on Parallel and Distributed Systems 20 (2009) 1260–1272.
- V. Andronikou, K. Mamouras, K. Tserpes, D. Kyriazis, T. Varvarigou, Dynamic QoS-aware data replication in grid environments based on data importance, Future Generation Computer Systems 28 (3) (2012) 544–553.
- N. Saadat, A. M. Rahmani, PDDRA: a new pre-fetching based dynamic data replication algorithm in Data Grids, Future Generation Computer Systems 28(7) (2011) 1045–1057.
- J. Taheri, Y. C. Lee, A. Y. Zomaya, H. J. Siegel, A bee colony based optimization approach for simultaneous job scheduling and data replication in grid environments, Computers & Operations Research (2011) http://dx. doi. org/10. 1016/j. cor. 2011. 11. 012.
- Ruay-Shiung Chang, Chih-Yuan Lin, Chun-Fu Lin, "An Adaptive Scoring Job Scheduling algorithm for grid computing", Future Generation Computer Systems 207 (2012) 79–89.