Abstract
Contention for shared resources on multicore processors is an emerging issue of great concern, as it affects directly performance of multicore CPU systems. In this regard, Contention-Aware scheduling algorithms provide a convenient and promising solution, aiming to reduce contention. By providing a collection of the scheduling methods proposed by latest research, this paper focuses on reviewing the challenges on solving the contention problem for UMA(Uniform Memory Access latency, single memory controller) and NUMA(Non Uniform Memory Access latencies, multiple memory controllers) types of system architectures. In this paper, we also provide a comparative evaluation of the solutions applicable to UMA systems which are the most extensively studied today, discussing their features, strengths and weaknesses. This paper aims to propose further improvements to these algorithms aiming to solve more efficiently the contention problem, considering that performance-asymmetric architectures may provide a cost-effective solution.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blagodurov S, Zhuravlev S, Fedorova A (2010) Contention-aware scheduling on multicore systems. ACM Trans Comput Syst 28
BlagodurovS, Zhuravlev S, Dashti M, Fedorova A (2011) A case for NUMA-aware contention management on multicore systems. In: The 2011 USENIX annual technical conference, pp 1–9
Goglin B, Furmento N (2009) Enabling high-performance memory migration for multithreaded applications on Linux. In: Proceedings of IPDPS
Jiang Y, Shen X, Chen J, Tripathi R (2008) Analysis and approximation of optimal co-scheduling on chip multiprocessors. In: Proceedings of the 17th international conference on parallel architectures and compilation techniques (PACT ‘08), pp 220–229
Kamali A (2010) Sharing aware scheduling on multicore systems. Master’s thesis, Simon Fraser University
Knauerhase R, Brett P, Hohlt B, Hahn S (2008) Using OS observations to improve performance in multicore systems. IEEE Micro 28(3):54–58
Li T, Baumberger D, Koufaty DA, Hahn S (2007) Efficient operating system scheduling for performance-asymmetric multi-core architectures. In: Proceedings of supercomputing, pp 1–4, 8–10
Lin J, Lu Q, Ding X, Zhang Z, Zhang X, Sadayappan P (2008) Gaining insights into multicore cache partitioning: bridging the gap between simulation and real systems. In: Proceedings of international symposium on high performance computer architecture, pp 1–5
Merkel A, Stoess J, Bellosa F (2010) Resource-conscious scheduling for energy efficiency on multicore processors. In: Proceedings of EuroSys, pp6–8, 11–13
Qureshi MK, Patt YN (2006) Utility-based cache partitioning: a low overhead, high-performance, runtime mechanism to partition shared caches. In: Proceedings of the 39th annual IEEE/ACM international symposium on microarchitecture, MICRO 39, pp 1–3
Shelepov D, Saez Alcaide JC, Jefferym S, Fedorova A, Perez N, Huang ZF, Blagodurov S, Kumar V (2009) A scheduler for heterogeneous multicore systems. SIGOPS Oper Rev 43(2)
Fedorova A, Seltzer MI, Smith, MD (2007) Improving performance isolation on chip multiprocessors via an operating system scheduler. In: Proceedings of the sixteenth international conference on parallel architectures and compilation techniques (PACT’07), pp 25–38
Chandra D, Guo F, Kim S, Solihin, Y (2005) Predicting inter-thread cache contention on a chip multi-processor architecture. In Proceedings of the 11th international symposium on high performance computer architecture, HPCA’05
Tam D, Azimi R, Stumm M (2007) Thread clustering: sharing-aware scheduling on SMP–CMP–SMT multiprocessors. In: Proceedings of EuroSys 2007
Xie Y, Loh G (2008) Dynamic classification of program memory behaviors in CMPs. In: Proceeding of CMP-MSI, pp 2–4
McGregor RL, Antonopoulos CD, Nikolopoulos DS Scheduling algorithms for effective thread pairing on irbid mutiprocessors. In: Proceedings of the 19th ieee international parallel and distributed processing symposium (IPDPS’05)
Zhang X, Dwarkadas S, Shen K (2009) Towards practical page coloring-based multicore cache management. In: Proceedings of the 4th ACM European conference on computer systems 2009
Zhang EZ, Jiang Y, Shen X (2010) Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? In: Proceedings of PPOPP
Zhuravlev S, Blagodurov S, Fedorova A (2010) Addressing contention on multicore processors via scheduling. In: Proceedings of ASPLOS, pp 1–6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Daci, G., Tartari, M. (2013). A Comparative Review of Contention-Aware Scheduling Algorithms to Avoid Contention in Multicore Systems. In: Das, V. (eds) Proceedings of the Third International Conference on Trends in Information, Telecommunication and Computing. Lecture Notes in Electrical Engineering, vol 150. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3363-7_12
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3363-7_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3362-0
Online ISBN: 978-1-4614-3363-7
eBook Packages: EngineeringEngineering (R0)