An Analysis of Various Job Scheduling Strategies in Grid Computing
Grid computing provides a high performance computing platform to solve larger scale applications by coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations. Scheduling onto the Grid is NPcomplete, so there is no best scheduling algorithm for all grid computing systems. An alternative is to select an appropriate scheduling algorithm to use in a given grid environment because of the characteristics of the tasks, machines and network connectivity. Job scheduling is one of the key research area in grid computing. The goal of scheduling is to achieve bighest possible system throughput and to match the application need with the available computing resources. Motivation of this study is to encourage and help the amateur researcher in the field of grid computing, so that they can understand easily the concept of scheduling and can contribute in developing more efficient and practical scheduling algorithm. This will benefit interested researchers to carry out further work in this thrust area of research.
Gnd computing Job grouping Job scheduling
Vishnu Kant Soni Raksha Sharma Manoj Kumar Mishra
School of Computer Engineering KIIT. UNIVERSITY Bhubaneswar, Orissa, INDIA
国际会议
2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)
大连
英文
1002-1006
2010-07-05（万方平台首次上网日期，不代表论文的发表时间）