Simulating Grid Schedulers with Deadlines and Co-Allocation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Simulating Grid Schedulers with Deadlines and Co-Allocation

Abstract

One of the true challenges in resource management in grids is to provide support for co-allocation, that is, the allocation of resources in multiples autonomous subsystems of a grid to single jobs. With reservation-based local schedulers, a grid scheduler can reserve processors with these schedulers to achieve simultaneous processor availability. However, with queuing-based local schedulers, it is much more difficult to guarantee this. In this paper we present mechanisms and policies for working around the lack of reservation mechanisms for jobs with deadlines that require co-allocation, and simulations of these mechanisms and policies.
No file

Dates and versions

hal-01430523 , version 1 (10-01-2017)

Identifiers

  • HAL Id : hal-01430523 , version 1

Cite

Alexis Ballier, Eddy Caron, Dick Epema, Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. [Research Report] TR-0061, CoreGRID. 2006. ⟨hal-01430523⟩
269 View
0 Download

Share

Gmail Facebook X LinkedIn More