Dynamic Resource Allocation in Desktop Grids

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5

Abstract

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.

Authors and Affiliations

Bismi A S , Dr. S. Karthik

Keywords

Related Articles

Web Based ā€˜C’ IDE: Approach

A Web based environment has been designed to execute C programs without explicitly installing any compilers on the machine, thus addressing the concerns of portability and accessibility. The environment runs on a Linux s...

A Permutation Gigantic Issues in Mobile Real Time Distributed Database : Consistency & Security

Several shape of Information System are broadly used in a variety of System Models. With the rapid development of computer network, Information System users concern more about data sharing in networks. In conventional re...

Robust Algorithm for Impulse Noise Reduction

This Paper presents highly efficient two phase schema for removing impulse noise. In the first phase, robust algorithm for noise detection is used to identify noisy pixels. In the second phase, the image is restored usin...

Bilateral Filtering using Modified Fuzzy Clustering for Image Denoising

This paper presents a novel bilateral filtering using weighed cm algorithm based on Gaussian kernel function for image manipulations such as segmentation and denoising . Our roposed bilateral filtering consists of the...

Appearance Based Recognition of American Sign Language Using Gesture Segmentation

The work presented in this paper goals to develop a system for automatic translation of static gestures of alphabets in American Sign Language. In doing so three feature extraction methods and neural network is used to r...

Download PDF file
  • EP ID EP155314
  • DOI -
  • Views 129
  • Downloads 0

How To Cite

Bismi A S, Dr. S. Karthik (2010). Dynamic Resource Allocation in Desktop Grids. International Journal on Computer Science and Engineering, 2(5), 1913-1918. https://europub.co.uk/articles/-A-155314