We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of res...
Sam Verboven, Peter Hellinckx, Jan Broeckhove, Fra...
In the context of computational grids, a metascheduler is the service responsible for scheduling jobs across many geographically distributed processor clusters. Typically, these s...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...