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.
Type de document :
[Research Report] TR-0061, CoreGRID. 2006
Liste complète des métadonnées
Contributeur : Eddy Caron <>
Soumis le : mardi 10 janvier 2017 - 02:16:28
Dernière modification le : samedi 21 avril 2018 - 01:27:29


  • HAL Id : hal-01430523, version 1



Alexis Ballier, Eddy Caron, Dick Epema, Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. [Research Report] TR-0061, CoreGRID. 2006. 〈hal-01430523〉



Consultations de la notice