HASS: a scheduler for heterogeneous multicore systems
HASS: a scheduler for heterogeneous multicore systems
复制标题
DOI：
10.1145/1531793.1531804
复制
发表时间：
2009-04
期刊：
影响因子：
--
通讯作者：
Daniel Shelepov;J. C. Saez;S. Jeffery;Alexandra Fedorova;Nestor Perez;Z. Huang;S. Blagodurov;
中科院分区：
文献类型：
--
作者：
Daniel Shelepov;J. C. Saez;S. Jeffery;Alexandra Fedorova;Nestor Perez;Z. Huang;S. Blagodurov;
与同类处理器相比，未来的异构单ISA多核处理器在潜在性能功耗比方面将具有优势。为了充分利用这一潜力，操作系统调度程序需要具有异构性感知，以便它可以根据两者的特征将作业与内核进行匹配。我们提出了一种支持异构性的签名支持调度算法，该算法使用每个线程的体系结构签名进行匹配，每个线程的体系结构签名是离线收集的线程体系结构属性的紧凑摘要。所得到的算法不依赖于动态剖析，并且相对简单且可伸缩。我们在OpenSolaris中实现了Hass，实现了高达13%的平均工作负载加速，达到了只有Oracle才能实现的最佳静态分配。我们还实现了之前提出的依赖于在线评测的动态IPC驱动算法。我们发现，动态剖析带来的复杂性、负载不平衡和相关的性能下降是成功使用该算法的重大挑战。因此，它未能实现预期的业绩增长，也未能超越哈斯。
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.