Resource-aware distributed scheduling strategies for large-scale computational Cluster/Grid systems

In this paper, we propose distributed algorithms referred to as Resource-Aware Dynamic Incremental Scheduling ( RADIS) strategies. Our strategies are specifically designed to handle large volumes of computationally intensive arbitrarily divisible loads submitted for processing at cluster/grid systems involving multiple sources and sinks ( processing nodes). We consider a real-life scenario, wherein the buffer space ( memory) available at the sinks ( required for holding and processing the loads) varies over time, and the loads have deadlines and propose efficient "pull-based" scheduling strategies with an admission control policy that ensures that the admitted loads are processed, satisfying their deadline requirements. The design of our proposed strategies adopts the divisible load paradigm, referred to as the divisible load theory ( DLT), which is shown to be efficient in handling large volume loads. We demonstrate detailed workings of the proposed algorithms via a simulation study by using real-life parameters obtained from a major physics experiment.