In this paper, we have shown the complexity of modeling
Map-Reduce when I/O interference is included. Existing
models make simplifying assumptions regarding the presence
(or lack of) I/O contention, which we believe are not
realistic for data intensive workloads. CPU and I/O costs
show very different scaling behavior when multiple tasks
are competing for the same resources, and these costs must
therefore be treated separately in the models.