Large caches used in scalable shared-memory architectures can avoid high memory access
time only if data is referenced within the address scope of the cache. Consequently, locality
is the key issue in multiprocessor performance. While CPU utilization still determines
scheduling decisions of contemporary schedulers, we propose novel scheduling policies
based on locality information derived from cache miss counters. A locality-conscious
scheduler can reduce the costs for reloading the cache after each context switch. Thus, the …