Mazen Mahmoud Kharbutli

Works (4)

Updated: July 5th, 2023 15:57

2010 conference paper

Improving cache performance by combining cost-sensitivity and locality principles in cache replacement algorithms

2010 ieee international conference on computer design, 76–83.

By: R. Sheikh & M. Kharbutli

Source: NC State University Libraries
Added: August 6, 2018

2008 journal article

Counter-based cache replacement and bypassing algorithms

IEEE TRANSACTIONS ON COMPUTERS, 57(4), 433–447.

By: M. Kharbutli* & Y. Solihin n

author keywords: caches; counter-based algorithms; cache replacement algorithms; cache bypassing; cache misses
TL;DR: A new counter-based approach to deal with cache pollution, predicting lines that have become dead and replacing them early from the L2 cache and identifying never-reaccessed lines, which is augmented with an event counter that is incremented when an event of interest such as certain cache accesses occurs. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2006 article

HeapMon: A helper-thread approach to programmable, automatic, and low-overhead memory bug detection

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, Vol. 50, pp. 261–275.

By: R. Shetty, M. Kharbutli n, Y. Solihin n & M. Prvulovic *

TL;DR: HeapMon is presented, a heap memory bug-detection scheme that has a very low performance overhead, is automatic, and is easy to deploy and relies on two new techniques to safely and significantly reduce bug checking frequency. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2005 journal article

Eliminating conflict misses using prime number-based cache indexing

IEEE TRANSACTIONS ON COMPUTERS, 54(5), 573–586.

By: M. Kharbutli n, Y. Solihin n & J. Lee *

author keywords: cache hashing; cache indexing; prime modulo; odd-multiplier displacement; conflict misses
TL;DR: An in-depth analysis of the pathological behavior of cache hashing functions is presented and two new hashing functions are proposed, prime modulo and odd-multiplier displacement, that are resistant to pathological behavior and yet are able to eliminate the worst-case conflict behavior in the L2 cache are proposed. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.