Abstract
In the grid context, the scheduling can be grouped into two categories: Offline scheduling and online scheduling. In the offline scheduling scenario, the sequence of jobs is known in advance, scheduling is based on information about all jobs in the sequence. While, in the online scheduling scenario a job is known only after all predecessors have been scheduled, and a job is scheduled only according to information of its predecessors in the sequence. This chapter focuses on resource management issue in the grid context, and introduces the two cost-based scheduling algorithms for offline job assignment and online job assignment on the computational grid, respectively.
| Original language | English |
|---|---|
| Title of host publication | Quantitative Quality of Service for Grid Computing |
| Subtitle of host publication | Applications for Heterogeneity, Large-Scale Distribution, and Dynamic Environments |
| Publisher | IGI Global |
| Pages | 74-90 |
| Number of pages | 17 |
| ISBN (Print) | 9781605663708 |
| DOIs | |
| State | Published - 2009 |
| Externally published | Yes |