Efficient Grid Scheduling through the Incremental Schedule-based Approach
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Periodical |
| Magazine / Source | Computational Intelligence |
| MU Faculty or unit | |
| Citation | |
| Web | DOI |
| Doi | http://dx.doi.org/10.1111/j.1467-8640.2010.00369.x |
| Field | Informatics |
| Keywords | Grid Computing; Heuristic; Incremental Approach; Local Search; Policy; Scheduling |
| Description | This paper concentrates on the application of schedule-based methods that improve on both the service delivered to the user and the traditional objective of machine usage. Importantly, the interaction between the incremental application of these methods and the dynamic character of the problem allows reasonable runtimes to be achieved. Two new schedule-based methods that are designed to schedule dynamically arriving jobs on machines in a computational Grid are formally described and experimentally evaluated in the paper. |
| Related projects: |