This Article Full Text (OnlineFirst PDF) Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Scopus Google Scholar Articles by Kapoor, N. K. Articles by Nandy, B. Social Bookmarking                         What's this?

Class-Based Grid Resource Management Strategies for On-Demand Jobs

¹ Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
² Department of Systems and Computer Engineering

^* To whom correspondence should be addressed. E-mail: majumdar{at}sce.carleton.ca.

	Abstract

Grid computing has emerged as a new paradigm for distributed systems, which promotes sharing of distributed resources. To maximize its benefits, it is essential to discover the resources available on the grid, and then effectively map the jobs to the resources for maximizing a given objective function. This paper focuses on the problem of matching of jobs to resources in a computing grid. Jobs are classified based on their service demands. Matching policies that use only the knowledge of job classes are introduced in this paper; simulation experiments demonstrate the effectiveness of these policies. Under a variety of different workload parameters the proposed matching policies demonstrate a performance comparable to, or better than, the well-known Minimum Completion Time matching policy, which is based on detailed a priori knowledge of jobs and resource characteristics.

First published on June 29, 2009
SIMULATION 2009, doi:10.1177/0037549709102484


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?