SIAM Journal on Computing
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
A new version of on-line variable-sized bin packing
Discrete Applied Mathematics
The Performance Impact of Advance Reservation Meta-scheduling
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling with Advanced Reservations
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Quality of Service on the Grid Via Metascheduling with Resource Co-Scheduling and Co-Reservation
International Journal of High Performance Computing Applications
Making the Grid Predictable through Reservations and Performance Modelling
The Computer Journal
An Online Scheduling Algorithm for Assigning Jobs in the Computational Grid
IEICE - Transactions on Information and Systems
Backfilling with lookahead to optimize the packing of parallel jobs
Journal of Parallel and Distributed Computing
On the impact of reservations from the grid on planning-based resource management
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
The design and implementation of the KOALA co-allocating grid scheduler
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
| Hi-index | 0.00 |
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. However, advance reservations will also cause the processing time horizon discontinuous and therefore reduce the utilization of local resources and lengthen the makespan (i.e., maximum completion time) of nonresumable normal jobs. Single machine scheduling is the basis of more complicated parallel machine scheduling. This study proposed a theoretic model, as well as four online scheduling algorithms, for local single machine schedulers to reduce the negative impact on the utilization of local resources and to shorten the makespan of non-AR jobs resulting from advance reservations for Grid jobs. The performances of the algorithms were investigated from both of the worst case and the average case viewpoints. Analytical results show that the worst case performance ratios of the algorithms against that of possible optimal algorithms are not less than 2. Experimental results for average cases suggest that the First Fit and the First Fit Decreasing algorithm are better choices for the local scheduler to allocate precedence-constrained and independent non-AR jobs respectively.