Reducing contention in Shared Last-Level Cache for throughput processors

NCUIR > administration > Office of Secretariat > journal & Dissertation > Item 987654321/104796

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/104796

Title:	Reducing contention in Shared Last-Level Cache for throughput processors
Authors:	周景揚;Kuo, Hsien-Kai;Lai, Bo-Cheng Charles;Jou, Jing-Yang
Contributors:	秘書室
Keywords:	Aggregates;Algorithms;Automation;Computer simulation;Policies;Processors;Scheduling;Searching
Date:	2014-01-01
Issue Date:	2026-04-23 11:58:22 (UTC+8)
Publisher:	Association for Computing Machinery (ACM)
Abstract:	摘要： Deploying the Shared Last-Level Cache (SLLC) is an effective way to alleviate the memory bottleneck in modern throughput processors, such as GPGPUs. A commonly used scheduling policy of throughput processors is to render the maximum possible thread-level parallelism. However, this greedy policy usually causes serious cache contention on the SLLC and significantly degrades the system performance. It is therefore a critical performance factor that the thread scheduling of a throughput processor performs a careful trade-off between the thread-level parallelism and cache contention. This article characterizes and analyzes the performance impact of cache contention in the SLLC of throughput processors. Based on the analyses and findings of cache contention and its performance pitfalls, this article formally formulates the aggregate working-set-size-constrained thread scheduling problem that constrains the aggregate working-set size on concurrent threads. With a proof to be NP-hard, this article has integrated a series of algorithms to minimize the cache contention and enhance the overall system performance on GPGPUs. The simulation results on NVIDIA's Fermi architecture have shown that the proposed thread scheduling scheme achieves up to 61.6% execution time enhancement over a widely used thread clustering scheme. When compared to the state-of-the-art technique that exploits the data reuse of applications, the improvement on execution time can reach 47.4%. Notably, the execution time improvement of the proposed thread scheduling scheme is only 2.6% from an exhaustive searching scheme. 出版日期： 2014-11-18 出處： ACM transactions on design automation of electronic systems, 2014-11, Vol.20 (1), p.1-28 資源來源： ACM Digital Library Complete 識別號： ISSN: 1084-4309 識別號： EISSN: 1557-7309 識別號： DOI: 10.1145/2676550
Appears in Collections:	[Office of Secretariat] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	33	View/Open

社群 sharing

Loading...