The Use of Incremental Schedule-based Approach for Efficient Job Scheduling
| Autoři | |
|---|---|
| Rok publikování | 2010 |
| Druh | Konferenční abstrakty |
| Fakulta / Pracoviště MU | |
| Citace | |
| Popis | Common requirements of users of computational clusters and Grids cannot be easily guaranteed by the current widely used queue-based scheduling approaches. We concentrate on the application of schedule-based methods that improve both the service delivered to the user as well as the traditional objective of machine usage. The Grid/cluster scheduling problem is dynamic due to changing state of the system. In such an environment, scheduling algorithm must be flexible and reasonably fast. Unlike to previous works, our schedule-based algorithms work in an ``incremental fashion", keeping the necessary runtime in an acceptable level while still enabling the application of advanced optimization algorithms. Incremental approach allows to keep the algorithm runtime low in contrast to the situations when the schedule is re-computed from scratch upon each job arrival. Moreover, the schedule-based algorithms show significant improvement in the quality of optimization in comparison with the queue-based methods. |
| Související projekty: |