Adaptive weight-based: an exclusive bypass algorithm for L3 cache in a three level cache hierarchy
by Banchhanidhi Dash; Debabala Swain; Bijay K. Paikaray
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 3, No. 1/2, 2017

Abstract: Cache memory plays a decisive role in recent day processors. Current processors use multi-level cache hierarchy to avoid the capacity misses. Still processors have to pay high cost due to conflict misses. To avoid such misses, several replacement techniques are used in the cache memory. Whereas, in a multi-level cache, where enormous applications are running simultaneously, a bypass replacement technique in the last level cache is found significant from the reduced miss cost, CPU performance point of view. This paper presents a similar solution of bypassing in the L3 cache, called adaptive weight-based (AWB) bypass algorithm which shows better performance assessment compared to LRU with different benchmark traces from SPEC.

Online publication date: Tue, 21-Mar-2017

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 Computational Systems Engineering (IJCSYSE):
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