An exclusive cache replacement policy based on read priority and dynamic sliding
by Banchhanidhi Dash; Debabala Swain; Bijay K. Paikaray
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 7, No. 3, 2017

Abstract: The conventional cache replacement algorithms have massive hardware cost with ambiguous logic and measurability. Increasing the cache levels do not give a better solution for the hardware complexity and performance issues in multi-core processors. Rather number of read misses on executing the complex memory intensive program can increase the execution time in multi-core processors. This paper proposes a new way of cache replacement policy weight-based read priority replacement (WRPR), which works on the read priority of a cache line in all levels of cache. By making it read prior instead of write, the cache lines with more read access are highly weighted. During replacement, the cache eviction is done from dynamic logical cache regions based on its weight. The algorithm performance is tested using multi-core cache simulator with different benchmark workloads in the SMPCache simulator. The proposed replacement policy can work on any exclusive cache level in a multi-level hierarchy. It shows an improved performance from the hit rate context.

Online publication date: Wed, 02-May-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com