Abstract
Analytical modeling is one of the most interesting approaches to evaluate the memory hierarchy behavior. Unfortunately, models have many limitations regarding the structure of the code they can be applied to, particularly when the path of execution depends on conditions calculated at run-time that depend on the input or intermediate data. In this paper we extend in this direction a modular analytical modeling technique that provides very accurate estimations of the number of misses produced by codes with regular access patterns and structures while having a low computing cost. Namely, we have extended this model in order to be able to analyze codes with data-dependent conditionals. In a previous work we studied how to analyze codes with a single and simple conditional sentence. In this work we introduce and validate a general and completely systematic strategy that enables the analysis of codes with any number of conditionals, possibly nested in any arbitrary way, while allowing the conditionals to depend on any number of items and atomic conditions.
This work has been supported in part by the Ministry of Science and Technology of Spain under contract TIC2001-3694-C02-02, and by the Xunta de Galicia under contract PGIDIT03-TIC10502PR.
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.
Similar content being viewed by others
References
Uhlig, R., Mudge, T.: Trace-Driven Memory Simulation: A Survey. ACM Computing Surveys 29, 128–170 (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)
Andrade, D., Fraguela, B., Doallo, R.: Cache behavior modeling of codes with datadependent conditionals. In: Krall, A. (ed.) SCOPES 2003. LNCS, vol. 2826, pp. 373–387. Springer, Heidelberg (2003)
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)
Fraguela, B.B., Touri o, J., Doallo, R., Zapata, E.L.: A compiler tool to predict memory hierarchy performance of scientific codes. Parallel Computing 30, 225–248 (2004)
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)
Vera, X., Xue, J.: Efficient Compile-Time Analysis of Cache Behaviour for Programs with IF Statements. In: 5th International Conference on Algorthms and Archiectures for Parallel Processing, pp. 396–407 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrade, D., Fraguela, B.B., Doallo, R. (2004). Modeling the Cache Behavior of Codes with Arbitrary Data-Dependent Conditional Structures. In: Yew, PC., Xue, J. (eds) Advances in Computer Systems Architecture. ACSAC 2004. Lecture Notes in Computer Science, vol 3189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30102-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30102-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23003-8
Online ISBN: 978-3-540-30102-8
eBook Packages: Springer Book Archive