Deadline-aware co-scheduling using anycast advance reservations in wavelength routed lambda grids

摘要

As grid applications evolve, the need for user controlled network infrastructure is apparent in order to support emerging dynamic and interactive services. Due to the inherent bandwidth offered by optical wavelength division multiplexed (WDM) networks, they prove to be a potential candidate to support the bandwidth intensive grid applications. In a grid environment, the available resources can be classified into two broad categories: grid resources which consist of computing and storage components that reside on each node of the network and network resources which provide bandwidth for the execution of a grid application. A typical grid application (job) is usually divided into a number of smaller tasks which need to be scheduled, on possibly different nodes of the network in order to ensure job completion. There usually exists some dependency between these tasks and a strict time-deadline within which the job needs to be completed. Rather than using an independent scheduling approach (at the grid and network levels), we address the co-scheduling problem in lambda-grids for advance reservation requests and aim at minimizing the job blocking probability. We use the anycasting communication paradigm referred to as co-anycasting, to allocate grid and network resources to all tasks of a job. We propose three heuristics: first free (FF), shortest hop (SH), and least used (LU) to solve the co-scheduling problem. Moreover, we compare the proposed co-anycasting approach to a grid-anycasting approach, wherein the anycasting flexibility is offered only at the grid level, and show through extensive simulations the performance benefit of using co-anycasting to support grid applications in a time-deadline environment.