Markov parameters tuning prediction to improve cache hit rate
by Benbin Chen; Donghui Guo
International Journal of Internet Protocol Technology (IJIPT), Vol. 8, No. 4, 2014

Abstract: Because the spatial and temporal locality of program codes, compiler could use heuristics and profile guided prediction to relocate the output of program codes to reduce the cache confliction. In this paper, for improving the average accessing time of memory subsystem by raising the instructions cache hit rate, compiler-assisted Markov parameters tuning (MPT) frequencies prediction techniques for codes relocation are proposed. Different with the traditional schemes that provide the fixed heuristics branch probability (FHBP) to calculate nodes frequencies (NF) for various kinds of programs, the Markov-based heuristics algorithm combining FHBP and parameters tuning techniques in MPT probability matrix is adopted for improving program NF prediction to take advantage of the probability matrix and model the control flow graph (CFG) in function more precision. The MPT model was simulated to illustrate the strengths of accurate expression of the program. Compare with the actual execution results of program with profile coverage tests, the experimental result is better fit to validate its feasibility.

Online publication date: Wed, 08-Apr-2015

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 Internet Protocol Technology (IJIPT):
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