A Capacity-Aware Thread Scheduling Method Combined with Cache Partitioning to Reduce Inter-Thread Cache Conflicts

スポンサーリンク

概要

• 論文の詳細を見る

• Chip multiprocessors (CMPs) improve performance by simultaneously executing multiple threads using integrated multiple cores. However, since these cores commonly share one cache, inter-thread cache conflicts often limit the performance improvement by multi-threading. This paper focuses on two causes of inter-thread cache conflicts. In shared caches of CMPs, cached data fetched by one thread are frequently evicted by another thread. Such an eviction, called inter-thread kickout (ITKO), is one of the major causes of inter-thread cache conflicts. The other cause is capacity shortage that occurs when one cache is shared by threads demanding large cache capacities. If the total capacity demanded by the threads exceeds the actual cache capacity, the threads compete to use the limited cache capacity, resulting in capacity shortage. To address inter-thread cache conflicts, we must take into account both ITKOs and capacity shortage. Therefore, this paper proposes a capacity-aware thread scheduling method combined with cache partitioning. In the proposed method, inter-thread cache conflicts due to ITKOs and capacity shortage are decreased by cache partitioning and thread scheduling, respectively. The proposed scheduling method estimates the capacity demand of each thread with an estimation method used in the cache partitioning mechanism. Based on the estimation used for cache partitioning, the thread scheduler decides thread combinations sharing one cache so as to avoid capacity shortage. Evaluation results suggest that the proposed method can improve overall performance by up to 8.1%, and the performance of individual threads by up to 12%. The results also show that both cache partitioning and thread scheduling are indispensable to avoid both ITKOs and capacity shortage simultaneously. Accordingly, the proposed method can significantly reduce the inter-thread cache conflicts and hence improve performance.

著者

• EGAWA Ryusuke

  Cyberscience Center, Tohoku University

• Kobayashi Hiroaki

  Cyberscience Center Tohoku University

• Egawa Ryusuke

  Cyberscience Center Tohoku University

• SATO Masayuki

  Cyberscience Center, Tohoku University

• TAKIZAWA Hiroyuki

  JST CREST

関連論文

• Characteristics of an on-chip cache an NEC SX vector architecture
• A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering
• A Self-Organized Overlay Network Management Mechanism for Heterogeneous Environments
• An Out-of-order Vector Processing Mechanism for Multimedia Applications
• C-024 An Auction based Resource Allocation Considering Multifaceted Utilities in a Peer to Peer Environment
• A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering
• LI-004 Accelerating Moller Intersection Algorithm Using Ray Packets
• A Self-Organized Overlay Network Management Mechanism for Heterogeneous Environments
• A Network Clustering Algorithm for Sybil-Attack Resisting
• A Capacity-Aware Thread Scheduling Method Combined with Cache Partitioning to Reduce Inter-Thread Cache Conflicts

スポンサーリンク