Scheduling of a parallel workload: Implementation and use of the argonne easy scheduler at PDC

Autor:	Lars Malinowsky, Per Öster
Rok vydání:	1998
Předmět:	Fixed-priority pre-emptive scheduling Computer science Two-level scheduling Distributed computing Operating system Processor scheduling Workload computer.software_genre computer Fair-share scheduling Scheduling (computing)
Zdroj:	Lecture Notes in Computer Science ISBN: 9783540654148 PARA
DOI:	10.1007/bfb0095351
Popis:	Scheduling of a workload of parallel jobs on a large parallel computer puts specific demands on a scheduling system. Especially if the objective is to give a good service for the largest parallel jobs. In this paper we give an overview of the implementation and extensions of the Argonne EASY scheduler at PDC. We describe necessary developments of EASY to adopt to an inhomogeneous platform, improvements of the scheduling algorithm with e.g. recursive backfill, and added features such as time-lock, i.e. reservation and mixed job resources.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::616eaec7d6c2b892eb17e759b474ab65 https://doi.org/10.1007/bfb0095351 Zobrazit plný text záznamu