Matching of independent jobs on a computing grid
Grid computing has emerged as a new paradigm for distributed computing which promotes sharing of distributed resources. To maximize the benefits of grid computing, 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 Minimum Completion Time matching policy, which is based on detailed a priori knowledge of jobs and resource characteristics.
|Keywords||Computing grids, Matching on grids, Resource management, Scheduling|
|Conference||International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007|
Kapoor, N.K. (Navdeep Kaur), Majumdar, S, & Nandy, B. (Biswajit). (2007). Matching of independent jobs on a computing grid. Presented at the International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS 2007, Part of the 2007 Summer Simulation Multiconference, SummerSim 2007.