Opportunities for Cache Friendly Process Scheduling
Opportunities for Cache Friendly Process Scheduling
复制标题
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
P. Koka;Mikko H. Lipasti
中科院分区：
文献类型：
--
作者：
P. Koka;Mikko H. Lipasti
多年来，操作系统流程计划一直是一个积极的研究领域。流程调度决策可能会对片上缓存中的容量和冲突遗漏产生巨大影响，因为不共享内存的过程将竞争缓存中的条目，而确实共享内存的过程可以有效地预取块或加热缓存。以共生的方式。在本文中，我们提供了上下文开关的详细表征，并量化了其影响。我们还研究了智能过程调度的潜力，以最大程度地减少上下文开关边界的缓存失误。我们已经开发了几种贪婪的启发式方法，使我们能够对缓存友好过程的好处进行痕量驱动的限制研究。我们表明，在某些交易工作负载中，可以实现高达37％的高速缓存率提高37％。我们还提出了一些机制来利用这一潜力。
Operating system process scheduling has been an active area of research for many years. Process scheduling decisions can have a dramatic impact on capacity and conflict misses in on-chip caches, since processes that do not share memory will compete for entries in the cache, while processes that do share memory can effectively pre-fetch blocks or warm the cache in a symbiotic fashion. In this paper we provide a detailed characterization of context switch misses and quantify its impact. We also investigate the potential of intelligent process scheduling that minimizes cache misses across context-switch boundaries. We have developed several greedy heuristics that enable us to perform a trace driven limit study on the benefits of cache friendly process scheduling. We show that up to 37% improvements in cache miss rates are achievable in some transactional workloads. We also propose some mechanisms to leverage this potential.