activity
20092021
most citedPractical Size-based Scheduling for MapReduce Workloads

11 citations · 62 across the 14 of their papers we have counts for

collaborators
Showing cs.DCShow all

6 papers · 1 filter

cs.DC2014

PSBS: Practical Size-Based Scheduling

Matteo Dell'Amico, Damiano Carra, Pietro Michiardi

Size-based schedulers have very desirable performance properties: optimal or near-optimal response time can be coupled with strong fairness guarantees. Despite this, such systems a…

cs.DC2014★ 6 cited

On User Availability Prediction and Network Applications

Matteo Dell'Amico, Maurizio Filippone, Pietro Michiardi +1

User connectivity patterns in network applications are known to be heterogeneous, and to follow periodic (daily and weekly) patterns. In many cases, the regularity and the correlat…

cs.DC2014

OS-Assisted Task Preemption for Hadoop

Mario Pastorelli, Matteo Dell'Amico, Pietro Michiardi

This work introduces a new task preemption primitive for Hadoop, that allows tasks to be suspended and resumed exploiting existing memory management mechanisms readily available in…

cs.DC2013★ 7 cited

A Simulator for Data-Intensive Job Scheduling

Matteo Dell'Amico

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…

cs.DC2013★ 11 cited

Practical Size-based Scheduling for MapReduce Workloads

Mario Pastorelli, Antonio Barbuzzi, Damiano Carra +2

We present the Hadoop Fair Sojourn Protocol (HFSP) scheduler, which implements a size-based scheduling discipline for Hadoop. The benefits of size-based scheduling disciplines are…

cs.DC2012

Adaptive Redundancy Management for Durable P2P Backup

Matteo Dell'Amico, Pietro Michiardi, Laszlo Toka +1

We design and analyze the performance of a redundancy management mechanism for Peer-to-Peer backup applications. Armed with the realization that a backup system has peculiar requir…