A Pressure-Aware Policy for Contention Minimization on Multicore Systems

被引:3
作者
Kundan, Shivam [1 ]
Marinakis, Theodoros [2 ]
Anagnostopoulos, Iraklis [1 ]
Kagaris, Dimitri [1 ]
机构
[1] Southern Illinois Univ, Sch Elect Comp & Biomed Engn, Carbondale, IL 62901 USA
[2] NVIDIA Corp, Redmond, WA 98052 USA
基金
美国国家科学基金会;
关键词
Chip multiprocessors; contention-aware scheduling; Linux; throughput; fairness; pressure minimization; PERFORMANCE; FAIR;
D O I
10.1145/3524616
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:26
相关论文
共 43 条
[1]  
[Anonymous], 2012, Polybench: The Polyhedral Benchmark Suite
[2]  
Berkelaar M., 2015, LPSOLVE INTERFACE LP
[3]   PARTIES: QoS-Aware Resource Partitioning for Multiple Interactive Services [J].
Chen, Shuang ;
Delimitrou, Christina ;
Martinez, Jose F. .
TWENTY-FOURTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXIV), 2019, :107-120
[4]  
Di Xu, 2012, Performance Evaluation Review, V40, P295, DOI 10.1145/2318857.2254792
[5]   KPart: A Hybrid Cache Partitioning-Sharing Technique for Commodity Multicores [J].
El-Sayed, Nosayba ;
Mukkara, Anurag ;
Tsai, Po-An ;
Kasture, Harshad ;
Ma, Xiaosong ;
Sanchez, Daniel .
2018 24TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA), 2018, :104-117
[6]   Perf& Fair: A Progress-Aware Scheduler to Enhance Performance and Fairness in SMT Multicores [J].
Feliu, Josue ;
Sahuquillo, Julio ;
Petit, Salvador ;
Duato, Jose .
IEEE TRANSACTIONS ON COMPUTERS, 2017, 66 (05) :905-911
[7]   Bandwidth-Aware On-Line Scheduling in SMT Multicores [J].
Feliu, Josue ;
Sahuquillo, Julio ;
Petit, Salvador ;
Duato, Jose .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (02) :422-434
[8]   Addressing Fairness in SMT Multicores with a Progress-Aware Scheduler [J].
Feliu, Josue ;
Sahuquillo, Julio ;
Petit, Salvador ;
Duato, Jose .
2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, :187-196
[9]   Seer: Leveraging Big Data to Navigate the Complexity of Performance Debugging in Cloud Microservices [J].
Gan, Yu ;
Zhang, Yanqi ;
Hu, Kelvin ;
Cheng, Dailun ;
He, Yuan ;
Pancholi, Meghna ;
Delimitrou, Christina .
TWENTY-FOURTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXIV), 2019, :19-33
[10]  
Gualandi S, 2013, LECT NOTES COMPUT SC, V8124, P356, DOI 10.1007/978-3-642-40627-0_29