http://www.cnr.it/ontology/cnr/individuo/prodotto/ID91940

A priority-based multilevel scheduler for batch jobs on grids (Contributo in atti di convegno)

Type

Label

A priority-based multilevel scheduler for batch jobs on grids (Contributo in atti di convegno) (literal)

Anno

Alternative label

Capannini G.; Baraglia R.; Pasquali M.; Ricci L.; Laforenza D. (2009)
A priority-based multilevel scheduler for batch jobs on grids
in International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, 13-16 July 2009
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url

http://puma.isti.cnr.it/dfdownloadnew.php?ident=/cnr.isti/2009-A2-132&langver=en&scelta=NewMetadata (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume

Proceedings International Conference on Parallel and Distributed Processing Techniques and Applications (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

In: PDPTA 2009 - International Conference on Parallel and Distributed Processing Techniques and Applications (Las Vegas, Nevada, 13-16 July 2009). Proceedings, pp. 444 - 450. Hamid R. Arabnia (ed.). CSREA Press, 2009. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto

ABSTRACT: During the last decades, the architectures devoted to the high performance computing changed their shape and structure several times. From the early SMP machines to the Clusters of computers, through the Computational Grids to nowadays Computing Clouds. If on one side this evolution brought to computing platform able to provide several Petaflops, on the other side the increased amount of computing power, obtained through the usage of thousands computer in parallel makes more and more complex an effective and efficient management of resources. In this paper, we propose a multicriteria job scheduler for scheduling a continuous stream of batch jobs on large-scale computing farms, called Convergent Scheduling 2.0 (CS 2.0), which is an enhancement of the scheduler described in [3]. CS 2.0 exploits a set of heuristics that drive the scheduler in taking decisions. Each heuristics manages a specific constraint, and contributes to compute the measurement of the matching degree between (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

CNR-ISTI, Pisa, Zurich University of Applied Sciences, Switzerland, Dipartimento di Informatica, Università di Pisa, CNR-IIT, Pisa (literal)

Titolo

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume

Abstract

During the last decades, the architectures devoted to the high performance computing changed their shape and structure several times. From the early SMP machines to the Clusters of computers, through the Computational Grids to nowadays Computing Clouds. If on one side this evolution brought to computing platform able to provide several Petaflops, on the other side the increased amount of computing power, obtained through the usage of thousands computer in parallel makes more and more complex an effective and efficient management of resources. In this paper, we propose a multicriteria job scheduler for scheduling a continuous stream of batch jobs on large-scale computing farms, called Convergent Scheduling 2.0 (CS 2.0), which is an enhancement of the scheduler described in [3]. CS 2.0 exploits a set of heuristics that drive the scheduler in taking decisions. Each heuristics manages a specific constraint, and contributes to compute the measurement of the matching degree between a job and a machine. Scheduling choices are taken both to meet the QoS requested by the submitted jobs and to optimize the exploitation of hardware and software resources. In order to validate CS 2.0, we compared it versus two common job scheduling algorithms: Easy and Flexible backfilling. CS 2.0 demonstrated to be able to compute good assignments that allow a better exploitation of resources with respect to the other algorithms. (literal)

Editore