Abstract
The increasing gap between the speed of the processor and the memory makes the role played by the memory hierarchy essential in the system performance. There are several methods for studying this behavior. Trace-driven simulation has been the most widely used by now. Nevertheless, analytical modeling requires shorter computing times and provides more information. In the last years a series of fast and reliable strategies for the modeling of set-associative caches with LRU replacement policy has been presented. However, none of them has considered the modeling of codes with data-dependent conditionals. In this article we present the extension of one of them in this sense.
This work has been supported in part by the Spanish Ministry of Science and Technology under contract TIC2001-3694-C02-02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Uhlig, R., Mudge, T.: Trace-Driven Memory Simulation: A Survey. ACM Computing Surveys 29, 128–170 (1997)
Ammons, G., Ball, T., Larus, J.R.: Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 85–96 (1997)
Fraguela, B.B., Doallo, R., Zapata, E.L.: Probabilistic Miss Equations: Evaluating Memory Hierarchy Performance. IEEE Transactions on Computers 52, 321–336 (2003)
Chatterjee, S., Parker, E., Hanlon, P., Lebeck, A.: Exact Analysis of the Cache Behavior of Nested Loops. In: Proc. of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI 2001), pp. 286–297 (2001)
Vera, X., Xue, J.: Let’s Study Whole-Program Behaviour Analytically. In: Proc. of the 8th Int’l Symposium on High-Performance Computer Architecture (HPCA8), pp. 175–186 (2002)
Gannon, D., Jalby, W., Gallivan, K.: Strategies for Cache and Local Memory Management by Global Program Transformation. Journal of Parallel and Distributed Computing 5, 587–616 (1988)
Temam, O., Fricker, C., Jalby, W.: Cache Interference Phenomena. In: Proc. Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 261–271. ACM Press, New York (1994)
Ghosh, S., Martonosi, M., Malik, S.: Cache Miss Equations: A Compiler Framework for Analyzing and Tuning Memory Behavior. ACM Transactions on Programming Languages and Systems 21, 702–745 (1999)
Harper, J.S., Kerbyson, D.J., Nudd, G.R.: Analytical Modeling of Set-Associative Cache Behavior. IEEE Transactions on Computers 48, 1009–1024 (1999)
McKinley, K.S., Temam, O.: Quantifying Loop Nest Locality Using SPEC 1995 and the Perfect Benchmarks. ACM Transactions on Computer Systems 17, 288–336 (1999)
Wolf, M.E., Lam, M.S.: A Data Locality Optimizing Algorithm. In: Proc. of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pp. 30–44 (1991)
Blume, W., Doallo, R., Eigenmann, R., Grout, J., Hoeflinger, J., Lawrence, T., Lee, J., Padua, D., Paek, Y., Pottenger, B., Rauchwerger, L., Tu, P.: Parallel Programming with Polaris. IEEE Computer 29, 78–82 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrade, D., Fraguela, B.B., Doallo, R. (2003). Cache Behavior Modeling of Codes with Data-Dependent Conditionals. In: Krall, A. (eds) Software and Compilers for Embedded Systems. SCOPES 2003. Lecture Notes in Computer Science, vol 2826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39920-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-39920-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20145-8
Online ISBN: 978-3-540-39920-9
eBook Packages: Springer Book Archive