Please use this identifier to cite or link to this item:
|Title:||Probabilistic modeling of data cache behavior|
|Keywords:||Data cache modeling|
Probabilistic execution time analysis
|Source:||Puranik, V.,Mitra, T.,Srikant, Y.N. (2009). Probabilistic modeling of data cache behavior. Embedded Systems Week 2009 - Proceedings of the 7th ACM International Conference on Embedded Software, EMSOFT '09 : 255-264. ScholarBank@NUS Repository. https://doi.org/10.1145/1629335.1629370|
|Abstract:||In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this goal, we introduce the notion of probabilistic access history that intuitively summarizes the history of data memory accesses along different program paths (to reach a particular program point) and their associated probabilities. An efficient static program analysis technique has been developed to compute the access history at all program points. We estimate the cache hit/miss probabilities and hence the expected access time of each data memory reference from the access history. Our experimental evaluation confirms the accuracy and viability of the probabilistic data cache modeling approach. Copyright 2009 ACM.|
|Source Title:||Embedded Systems Week 2009 - Proceedings of the 7th ACM International Conference on Embedded Software, EMSOFT '09|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.