Survey of Resource and Grouping Based Job Scheduling Algorithm in Grid Computing?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.2, No. 5)Publication Date: 2013-05-15
Authors : Sandeep Kaur Sukhpreet Kaur;
Page : 214-218
Keywords : Grid computing; scheduling algorithm; Grouping strategy; Job scheduling; Load balancing;
Abstract
Grid computing is distributed computing environment, which enabling the dynamic selection, sharing resources based on availability, capability, performance or cost of these computing resource and simultaneously also based on organization specific requirements. The main purpose of Grid computing is to share the computational power, storage memory, network resource to solve a large problem. The goal of the job scheduler should be maximize the resource utilization and minimize the processing time of the job. Although Grids has been used for executing application with compute-intensive jobs but there are several applications with light weight jobs. The job grouping strategy improves the performance of application with large number of small processing requirements jobs. Motivation of this paper is to encourage the researcher in field of grid computing, so that they can understand easily the concept of job grouping strategy and can contribute in developing more efficient job grouping based scheduling algorithm.
Other Latest Articles
- Flexible Bloom for Searching Textual Content Based Retrieval System in an Unstructured P2P Overlay Networks?
- Geoestadística y arqueología: una nueva perspectiva analítico-interpretativa en el análisis espacial intra-site
- Fiscal policy and economic growth: a simulation analysis for Bolivia
- Análisis de la participación laboral de la mujer en el mercado ecuatoriano
- Diferencia de gastos según tamaño y composición familiar: una aplicación para Ecuador usando escalas de equivalencia
Last modified: 2013-05-15 15:52:20