Graduate School and Research Center in Digital Sciences

A simulator for data-intensive job scheduling

Dell'Amico, Matteo

Research Report RR-13-282

Despite the fact that size-based schedulers can give excellent results in terms of both average response times and fairness, data-intensive computing execution engines generally do not employ size-based schedulers, mainly because of the fact that job size is not known a priori. In this work, we perform a simulation-based analysis of the performance of sizebased schedulers when they are employed with the workload of typical data-intensive schedules and with approximated size estimations. We show results that are very promising: even when size estimation is very imprecise, response times of size-based schedulers can be definitely smaller than those of simple scheduling techniques such as processor sharing or FIFO.

Document Arxiv Bibtex

Title:A simulator for data-intensive job scheduling
Keywords:Data-intensive computing, scheduling, simulation
Department:Digital Security
Eurecom ref:4056
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Research Report RR-13-282 and is available at :
Bibtex: @techreport{EURECOM+4056, year = {2013}, title = {{A} simulator for data-intensive job scheduling}, author = {{D}ell'{A}mico, {M}atteo}, number = {EURECOM+4056}, month = {06}, institution = {Eurecom}, url = {},, }