An Adaptive Insertion and Promotion Policy for Partitioned Shared Caches

Malaysian Technical Universities Conference on Engineering and Technology 2017

Mahrom, Norfadila^1 ; Liebelt, Michael^2 ; Raof, Rafikha Aliana A.^1 ; Daud, Shuhaizar^1 ; Ghazali, Nur Hafizah^1

School of Computer and Communication Engineering, Universiti Malaysia Perlis, Perlis, Arau

02600, Malaysia^1

School of Electrical and Electronic Engineering, Faculty of Engineering, Computer and Mathematical Sciences, University of Adelaide, SA

5005, Australia^2

关键词: Cache replacement policy;    Least-recently-used policies;    Multi processor systems;    Multiple processors;    Pulmonary tuberculosis;    Replacement strategy;    Shared cache managements;    Simultaneous access;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/318/1/012048/pdf
DOI  :  10.1088/1757-899X/318/1/012048

来源: IOP

【 摘 要 】

Cache replacement policies in chip multiprocessors (CMP) have been investigated extensively and proven able to enhance shared cache management. However, competition among multiple processors executing different threads that require simultaneous access to a shared memory may cause cache contention and memory coherence problems on the chip. These issues also exist due to some drawbacks of the commonly used Least Recently Used (LRU) policy employed in multiprocessor systems, which are because of the cache lines residing in the cache longer than required. In image processing analysis of for example extra pulmonary tuberculosis (TB), an accurate diagnosis for tissue specimen is required. Therefore, a fast and reliable shared memory management system to execute algorithms for processing vast amount of specimen image is needed. In this paper, the effects of the cache replacement policy in a partitioned shared cache are investigated. The goal is to quantify whether better performance can be achieved by using less complex replacement strategies. This paper proposes a Middle Insertion 2 Positions Promotion (MI2PP) policy to eliminate cache misses that could adversely affect the access patterns and the throughput of the processors in the system. The policy employs a static predefined insertion point, near distance promotion, and the concept of ownership in the eviction policy to effectively improve cache thrashing and to avoid resource stealing among the processors.