Scheduling multiple jobs onto a platform enhances system utilization by sharing resources.
The benefits from higher resource utilization include reduced cost to construct, operate, and maintain a system, which often includes energy consumption.
Maximizing these benefits comes at a price -- resource contention among jobs increases job completion time.
In this paper, we analyze slow-downs of jobs due to contention for multiple resources in a system; referred to as dilation factor
We observe that multiple-resource contention creates non-linear dilation factors of jobs.
From this observation, we establish a general quantitative model for dilation factors of jobs in multi-resource systems.
A job is characterized by a vector-valued loading statistics and dilation factors of a job set are given by a quadratic function of their loading vectors.
We demonstrate how to systematically characterize a job, maintain the data structure to calculate the dilation factor (loading matrix), and calculate the dilation factor of each job.
We validate the accuracy of the model with multiple processes running on a native Linux server,
virtualized servers, and with multiple MapReduce workloads co-scheduled in a cluster.
Evaluation with measured data shows that the D-factor model has an error margin of less than 16%.
We extended the D-factor model to capture the slow-down of applications when multiple identical resources exists such as multi-core environments and multi-disks environments.
Validation results of the extended D-factor model with HPC checkpoint applications on the parallel file systems show that D-factor accurately captures the slow down of concurrent applications in such environments.
