The week's pick
Random Articles
Reseach Article
An ACO Algorithm for Scheduling Data Intensive Application with Various QOS Requirements
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 27 - Number 10 |
| Year of Publication: 2011 |
| Authors: S.Aranganathan, K.M.Mehata |
10.5120/3340-4598
|
S.Aranganathan, K.M.Mehata . An ACO Algorithm for Scheduling Data Intensive Application with Various QOS Requirements. International Journal of Computer Applications. 27, 10 ( August 2011), 1-5. DOI=10.5120/3340-4598
Abstract
Grid computing is rapidly growing in the distributed heterogeneous environment for utilizing and sharing large scale resources to solve complex scientific problems. The main goal of grid computing is to aggregate the power of widely distributed resources and provide non trivial QOS services to the users. To achieve this goal, an efficient grid scheduling algorithm is required. The problem of scheduling on data intensive application in terms of QOS requirements is challenging and it significantly influences the performance of grids. The existing algorithms for scheduling the data intensive application can only tackle the problems with either system centric or application centric. This paper aims to propose a new algorithm based on ant colony optimization to schedule the data intensive application which combines both application centric and system centric benefits. We formulate the problem and simulation results demonstrate the effectiveness of proposed scheduling algorithm.
References
- Foster, I. and Kesselman, C. (eds.): The Grid 2: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (2003).
- Stockinger, H., Donno, F., Puccinelli, R. and Stockinger, K.: Data Grid Tutorials with Hands-on Experience. In: IEEE International Symp. on Cluster Computing and the Grid (2004),152-159.
- Park, S. M., Kim, J. H.: Chameleon: “A Resource Scheduler in A Data Grid Environment”. In: Proceedings of the 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID’03).
- Li, K.: “Job Scheduling for Grid Computing on Metacomputers” In: Proceedings of the 19th IEEE International Parallel and Dist. Processing Symp (IPDPS’05).
- Buyya, R., Abramson, D. and Venugopal, S.: “The Grid Economy”. In: proceedings of the IEEE, vol. 93, NO. 3, March 2005, 698-714.
- Dorigo M V Maniezzo A Colorni “The Ant System : Optimization by colony of cooperating agent” IEEE Transaction on Systems, and Cybernetics Vol 26 No 1, pp 29-41, 1996.
- Aggarwal, A. K., Kent, R. D.: “An Adaptive Generalized Scheduler for Grid Application”. In: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (HPCS’05).
- Fan, H., Hua, Zh., Li, J. and Yuan, D.: “Solving a Shortest Path Problem by Ant Algorithm”. In: Proceedings of the Third International Conference on Machine Learning and Cybernetics, Shanghai, 26-29 August 2004, 3174-3177.
- Richard Mccltchey, Ashiq Anjum, Heinz Stockinger, Arshad Ali, Ian willers “Bulk Scheduling with the DIANA Scheduler” IEEE Transaction on Nuclear Science Vol 53 No 6 Dec. 2006.
- Richard Mccltchey, Ashiq Anjum, Heinz Stockinger, Arshad Ali, Ian willers, Michael Thomas “ Data intensive and Network aware (DIANA) Grid scheduling” J Grid comp.(2007) 5: 43-64.
- kavitha Ranganathan,K Foster I : “Decuopling computation and data scheduling in distributed intensive application” In : International Symposium on High performance distributed Computing(HPDC-11)Scotland,2002.
- Xu, L., Wang, B. and Ai, B.: “A Strategy for Data Replication in Data Grids. In: Current Trends in High Performance Computing and Its Applications”. Springer- Verlag, Berlin Heidelberg (2005), 557-562.
- Jia Yu, Rajkumar Buyya and Chen Khong Tham, “QoS-based Scheduling of Workflow Applications on Service Grids”, Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing (e-Science 2005, IEEE CS Press, Los Alamitos, CA, USA), Dec. 5-8, 2005, Melbourne, Australia.
- Xu, Zh., Hou, X., Sun, J.: “Ant algorithm-based task scheduling in grid computing”. CCECE 2003 – CCGEl 2003, Montreal, May/mai 2003, 1107-1110.
- Xiangang Zhao, Bai Wang et al “QOS – Based Algorithm for Job Allocation and Scheduling in Data Grid” GCCW’06 IEEE international conference 2006.
- Srikumar Venugopal and Rajkumar Buyya, “A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids”, 6th International Conference on Algorithms and Architectures for Parallel Processing , Melbourne, Australia.
- H.Yan, X.Shen,Xli and MWu,”An Improved ant algorithm for job scheduling in Grid computing” In proceeding of fourth international conference of Machine Learning and cyber netics,18-21 August 2005.
- Anthony Sulistio, Uros Cibej, Borut Robic and Rajkumar Buyya “A Tool for Modelling and Simulation of Data Grids with Integration of Data Storage, Replication and Analysis”, Technical Report, GRIDS-TR-2005-13, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia, Nov. 8, 2005.
Index Terms
Keywords