A Pressure-Aware Policy for Contention Minimization on Multicore Systems

Author:

Kundan Shivam1ORCID,Marinakis Theodoros2,Anagnostopoulos Iraklis1ORCID,Kagaris Dimitri1

Affiliation:

1. School of Electrical, Computer and Biomedical Engineering, Southern Illinois University, Carbondale, Illinois, U.S.A.

2. NVIDIA Corporation, Redmond, Washington, U.S.A

Abstract

Modern Chip Multiprocessors (CMPs) are integrating an increasing amount of cores to address the continually growing demand for high-application performance. The cores of a CMP share several components of the memory hierarchy, such as Last-Level Cache (LLC) and main memory. This allows for considerable gains in multithreaded applications while also helping to maintain architectural simplicity. However, sharing resources can also result in performance bottleneck due to contention among concurrently executing applications. In this work, we formulate a fine-grained application characterization methodology that leverages Performance Monitoring Counters (PMCs) and Cache Monitoring Technology (CMT) in Intel processors. We utilize this characterization methodology to develop two contention-aware scheduling policies, one static and one dynamic , that co-schedule applications based on their resource-interference profiles. Our approach focuses on minimizing contention on both the main-memory bandwidth and the LLC by monitoring the pressure that each application inflicts on these resources. We achieve performance benefits for diverse workloads, outperforming Linux and three state-of-the-art contention-aware schedulers in terms of system throughput and fairness for both single and multithreaded workloads. Compared with Linux, our policy achieves up to 16% greater throughput for single-threaded and up to 40% greater throughput for multithreaded applications. Additionally, the policies increase fairness by up to 65% for single-threaded and up to 130% for multithreaded ones.

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Hardware and Architecture,Information Systems,Software

Reference43 articles.

1. PARTIES

2. Nosayba El-Sayed, Anurag Mukkara, Po-An Tsai, Harshad Kasture, Xiaosong Ma, and Daniel Sanchez. 2018. KPart: A hybrid cache partitioning-sharing technique for commodity multicores. In IEEE International Symposium onHigh Performance Computer Architecture (HPCA’18). IEEE, 104–117.

3. Josué Feliu, Julio Sahuquillo, Salvador Petit, and José Duato. 2015. Addressing fairness in SMT multicores with a progress-aware scheduler. In IEEE International Parallel & Distributed Processing Symposium. IEEE, 187–196.

4. Bandwidth-Aware On-Line Scheduling in SMT Multicores

5. Perf&Fair: A Progress-Aware Scheduler to Enhance Performance and Fairness in SMT Multicores

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Divide&Content: A Fair OS-Level Resource Manager for Contention Balancing on NUMA Multicores;IEEE Transactions on Parallel and Distributed Systems;2023-11

2. Designing Secure Performance Metrics for Last Level Cache;2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2023-05

3. A Heterogeneity-Aware Replacement Policy for the Partitioned Cache on Asymmetric Multi-Core Architectures;Micromachines;2022-11-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3