Realistic Workload Scheduling Policies for Taming the Memory Bandwidth Bottleneck of SMPs

In this paper we reformulate the thread scheduling problem on multiprogrammed SMPs Scheduling algorithms usually attempt to maximize performance of memory intensive applications by optimally exploiting the cache hierarchy We present experimental results indicating that – contrary to the common belief – the extent of performance loss of memory-intensive, multiprogrammed workloads is disproportionate to the deterioration of cache performance caused by interference between threads In previous work [1] we found that memory bandwidth saturation is often the actual bottleneck that determines the performance of multiprogrammed workloads Therefore, we present and evaluate two realistic scheduling policies which treat memory bandwidth as a first-class resource Their design methodology is general enough and can be applied to introduce bus bandwidth-awareness to conventional scheduling policies Experimental results substantiate the advantages of our approach.