Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

A Hierarchical Resource Reservation Algorithm for Network Enabled Servers

Eddy Caron 1 Frédéric Desprez 1, 2 Franck Petit 2 Vincent Villain 2 
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper presents the application of the PIF algorithm to a Network Enabled Server environment. Hierarchical scheduling is applied to improve the scalability of the overall architecture and fault tolerance problems are addressed using timers. The simulation shows that gains can be obtained using such a platform over single scheduler approaches.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:05:24 PM
Last modification on : Friday, February 4, 2022 - 3:08:47 AM


  • HAL Id : inria-00071885, version 1



Eddy Caron, Frédéric Desprez, Franck Petit, Vincent Villain. A Hierarchical Resource Reservation Algorithm for Network Enabled Servers. [Research Report] RR-4701, LIP RR-2003-03, INRIA,LIP. 2003. ⟨inria-00071885⟩



Record views


Files downloads