Recent developments in Big Data frameworks are moving towards reservation based approaches as a mean to manage the increasingly complex mix of computations, whereas preemption techniques are employed to meet strict jobs deadlines. Within this work we propose and evaluate a new planning algorithm in the context of reservation based scheduling. Our approach is able to achieve high cluster utilization while minimizing the need for preemption that causes system overheads and planning mispredictions.

Preemption-aware planning on Big-Data systems

RABOZZI, MARCO;MAZZUCCHELLI, MATTEO;CORDONE, ROBERTO;FUMAROLA, GIOVANNI MATTEO;SANTAMBROGIO, MARCO DOMENICO
2016

Abstract

Recent developments in Big Data frameworks are moving towards reservation based approaches as a mean to manage the increasingly complex mix of computations, whereas preemption techniques are employed to meet strict jobs deadlines. Within this work we propose and evaluate a new planning algorithm in the context of reservation based scheduling. Our approach is able to achieve high cluster utilization while minimizing the need for preemption that causes system overheads and planning mispredictions.
9781450340922
9781450340922
Software
File in questo prodotto:
File Dimensione Formato  
a48-rabozzi-2.pdf

Accesso riservato

: Publisher’s version
Dimensione 193.22 kB
Formato Adobe PDF
193.22 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/1003720
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact