a set of schedulers for grid networks
Central to grid processing is the scheduling of application tasks to resources. Schedulers need to consider heterogeneous computational and communication resources, producing the shortest possible schedule under time constraints dictated by both the application needs and the frequency of fluctuation of resource availability. This paper introduces a set of schedulers with such characteristics.
grid networks linear programming task scheduling