Concurrency and Computation Practice and Experience · 2006 · 22 citations · 8 references
ComputingComputer ScienceComputer SystemsDistributed SystemsGrid ComputingSchedulingCpu SchedulingJob SchedulingResource SchedulingScheduling TheoryTask SchedulingWorkload SchedulingResponse TimeWorkloadWorkload-aware Scheduling
Abstract We present a scheme for reserving job resources with imprecise requests. Typical parameters such as the estimated runtime, the start time or the type or number of required CPUs need not be fixed at submission time but can be kept fuzzy in some aspects. Users may specify a list of preferences which guide the system in determining the best matching resources for the given job. Originally, the impetus for our work came from the need for efficient co‐reservation mechanisms in the Grid where rigid constraints on multiple job components often make it difficult to find a feasible solution. Our method for handling fuzzy reservation requests gives the users more freedom to specify the requirements and it gives the Grid Reservation Service more flexibility to find optimal solutions. In the future, we will extend our methods to process co‐reservations. We evaluated our algorithms with real workload traces from a large supercomputer site. The results indicate that our scheme greatly improves the flexibility of the solution process without having much affect on the overall workload of a site. From a user's perspective, only about 10% of the non‐reservation jobs have a longer response time, and from a site administrator's view, the makespan of the original workload is extended by only 8% in the worst case. Copyright © 2006 John Wiley & Sons, Ltd.
8
RSVP: a new resource ReSerVation Protocol
Li Zhang, S. Deering, Deborah Estrin et al. · IEEE Network · 1993 · 1.5K citations
Scheduling with advanced reservations
Warren Smith, Ian Foster, Valerie Taylor · 2002 · 279 citations