Real-Time Divisible Load Scheduling with Advance Reservation

Abstract

Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, previous approaches have no support for advance reservations. However, with the emergence of grid applications that require simultaneous access to multi-site resources, supporting advance reservations in a cluster has become increasingly important. In this paper we propose a new divisible load real-time scheduling algorithm that supports advance reservations in a cluster. Our approach not only enforces the real-time agreement but also addresses the under-utilization concerns raised by advance reservations. The impact of advance reservations on system performance is systematically studied. Simulation results show that, with the proposed algorithm and appropriate advance reservations, the system performance could be maintained at the same level as the no reservation case.