HASS
Daniel Shelepov, Juan Carlos Sáez, Stacey Jeffery et al. · ACM SIGOPS Operating Systems Review · 2009
Future heterogeneous single-ISA multicore processors will have an edge in potential performance per watt over comparable homogeneous processors. To fully tap into that potential, the OS scheduler needs to be heterogeneity-aware, so it can match jobs to cores according to characteristics of both. We propose a Heterogeneity-Aware Signature-Supported scheduling algorithm that does the matching using per-thread architectural signatures, which are compact summaries of threads' architectural properties collected offline. The resulting algorithm does not rely on dynamic profiling, and is comparatively simple and scalable. We implemented HASS in OpenSolaris, and achieved average workload speedups of up to 13%, matching best static assignment, achievable only by an oracle. We have also implemented a dynamic IPC-driven algorithm proposed earlier that relies on online profiling. We found that the complexity, load imbalance and associated performance degradation resulting from dynamic profiling are significant challenges to using this algorithm successfully. As a result it failed to deliver expected performance gains and to outperform HASS.
Cited by 224 works. doi:10.1145/1531793.1531804
Authors
- Daniel Shelepov
- Juan Carlos Sáez
- Stacey Jeffery
- Alexandra Fedorova
- Zhi feng Huang
- Sergey Blagodurov
- Viren Kumar
References
- Pin
- The Landscape of Parallel Computing Research: A View from Berkeley
- Pin
- Evaluating associativity in CPU caches
- Amdahl's Law in the Multicore Era
- A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory
- Single-ISA Heterogeneous Multi-Core Architectures: The Potential for Processor Power Reduction
- Thousand core chips
- Dynamic instrumentation of production systems
- Single-ISA Heterogeneous Multi-Core Architectures for Multithreaded Workload Performance