Authors: Sheela Kathavate; Lakshmi Rajesh; N.K. Srinath
Addresses: Department of Computer Science and Engineering, Sir M. Visvesvaraya Institute of Technology, International Airport Road, Bengaluru 562 157, Karnataka, India ' Department of Computer Science and Engineering, Sir M. Visvesvaraya Institute of Technology, International Airport Road, Bengaluru 562 157, Karnataka, India ' Department of Computer Science and Engineering, R.V. College of Engineering, Mysore Road, Bengaluru 560 059, Karnataka, India
Abstract: As chip multiprocessors (CMP) have become eminent in all areas of computing, it is inevitable for the operating system to schedule processes efficiently on different cores. These multi-cores pose different challenges of which shared resource contention is the dominant one, as cores share resources like last level cache (LLC) and main memory. This can lead to poor and unpredictable performance of the threads running on the system. The cache replacement policy of LLC becomes critical in managing the cache data in an efficient way. Though prominent, least recently used (LRU) algorithm has some issues with applications which do not follow the temporal locality pattern. This study proposes a modification to the LRU algorithm where a random selection of the victim from 'N' LRU blocks yields better results than the conventional method. The evaluation of the algorithm is carried out using Multi2sim simulator using Parsec and Splash2 benchmarks. The results show an overall performance improvement in hit ratio up to 6% and 2% over LRU for PARSEC and SPLASH2 benchmarks respectively.
Keywords: multi-core; last level cache; LLC; least recently used; LRU; multi2sim; parsec; splash; hit ratio; performance.
International Journal of Computer Aided Engineering and Technology, 2019 Vol.11 No.1, pp.111 - 121
Available online: 05 Nov 2018 *Full-text access for editors Access for subscribers Free access Comment on this article