Grid computing (or the use of computational grids) is the application of several computers to a single problem at the same time. In grid computing ,the computing becomes pervasive and individual users(or client application)gain access to computing resources (processors ,storage ,data,applications,and so on)as needed with little or no knowledge of where those resources are located or what the underlying technologies, hardware ,operating system and so on. This paper address the problem of resource scheduling ,and there are so many resource scheduling algorithms .Resource scheduling algorithm may be centralized one and distributed one. One of the latest one is the multi-variable best fit algorithm, which deals with storage systems, and it enhanced in this work. and this algorithm is dealing with data grids for blade servers. so, this algorithm is modified for computational grids, especially with desktop systems with minimum spanning algorithm for node selection and it is giving good results. In desktop grid environment, dynamic scheduling becomes very important and globus like toolkits are not having the scheduler as its own, and it needs other schedulers are not specially for computational grids.
展开▼
