Cache-affinity scheduling for fine grain multithreading
Cache-affinity scheduling for fine grain multithreading
复制标题
细粒度多线程的缓存亲和性调度
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Joseph Cordina
中科院分区：
文献类型：
--
作者：
Kurt Debattista;K. Vella;Joseph Cordina
在多线程应用程序中，由于频繁的上下文切换导致数据访问局部性丢失，缓存利用率通常很低。这个问题
当引入动态负载平衡并且线程迁移破坏缓存内容时，在本文中，我们提出了一个
技术，我们称之为“批处理”，用于减少细粒度多线程对缓存性能的负面影响。运行在单处理器和共享内存多处理器上的原型编译器进行了描述，并最终实验结果表明，应用我们的技术后观察到的改进。
Cache utilisation is often very poor in multithreaded applications, due to the loss of data access locality incurred by frequent context switching. This problem
is compounded on shared memory multiprocessors when dynamic load balancing is introduced and thread migration disrupts cache content. In this paper, we present a
technique, which we refer to as ‘batching’, for reducing the negative impact of fine grain multithreading on cache performance. Prototype schedulers running on uniprocessors and shared memory multiprocessors are described, and finally experimental results which illustrate the improvements observed after applying our techniques are presented.