Wait-free cache-affinity thread scheduling
Wait-free cache-affinity thread scheduling
复制标题
无等待缓存亲和性线程调度
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
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, as thread migration disrupts cache content. Batching, a technique for reducing the negative impact of fine grain multithreading on cache performance is introduced to mitigate this problem. Moreover, the related issue of contention for shared data within a thread scheduler for shared memory multiprocessors is considered. In this regard wait-free techniques are applied in lieu of conventional lock-based methods for accessing internal scheduler structures, alleviating to some extent serialisation and hence the degree of contention. Prototype schedulers which make use of the above ideas are described, and finally experimental results which illustrate the observed improvements are presented.