{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T23:23:49Z","timestamp":1778628229984,"version":"3.51.4"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0014135, 66905 and DE-AC05-76RL01830"],"award-info":[{"award-number":["DE-SC0014135, 66905 and DE-AC05-76RL01830"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1513120 and 1731612"],"award-info":[{"award-number":["1513120 and 1731612"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Optimizing compilers implement program transformation strategies aimed at reducing data movement to or from main memory by exploiting the data-cache hierarchy. However, instead of attempting to minimize the number of cache misses, very approximate cost models are used, due to the lack of precise compile-time models for misses for hierarchical caches. The current state of practice for cache miss analysis is based on accurate simulation. However, simulation requires time proportional to the dataset\/problem size, as well as the number of distinct cache configurations of interest to be evaluated.<\/jats:p>\n          <jats:p>This paper takes a fundamentally different approach, by focusing on polyhedral programs with static control flow. Instead of relying on costly simulation, a closed-form solution for modeling of misses in a set associative cache hierarchy is developed. This solution can enable program transformation choice at compile time to optimize cache misses. A tool implementing the approach has been developed and used for validation of the framework.<\/jats:p>","DOI":"10.1145\/3158120","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T14:21:49Z","timestamp":1514557309000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Analytical modeling of cache behavior for affine programs"],"prefix":"10.1145","volume":"2","author":[{"given":"Wenlei","family":"Bao","sequence":"first","affiliation":[{"name":"Ohio State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Krishnamoorthy","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-Noel","family":"Pouchet","sequence":"additional","affiliation":[{"name":"Colorado State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"M. Adams. 2014. HPGMG: a benchmark for ranking high performance computing systems. (2014). https:\/\/www.hpgmg.org\/  M. Adams. 2014. HPGMG: a benchmark for ranking high performance computing systems. (2014). https:\/\/www.hpgmg.org\/","DOI":"10.2172\/1131029"},{"key":"e_1_2_2_2_1","first-page":"215","article-title":"1989","author":"Agarwal A.","year":"1989","unstructured":"A. Agarwal , J. Hennessy , and M. Horowitz . 1989 . An Analytical Cache Model. ACM Transactions on Computer Systems ( 1989 ), 184\u015b 215 . A. Agarwal, J. Hennessy, and M. Horowitz. 1989. An Analytical Cache Model. ACM Transactions on Computer Systems (1989), 184\u015b215.","journal-title":"An Analytical Cache Model. ACM Transactions on Computer Systems ("},{"key":"e_1_2_2_3_1","first-page":"544","article-title":"2001. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests","author":"Ahmed N.","year":"2001","unstructured":"N. Ahmed , N. Mateev , and K. Pingali . 2001. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests . International Journal of Parallel Programming ( 2001 ), 493\u015b 544 . N. Ahmed, N. Mateev, and K. Pingali. 2001. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. International Journal of Parallel Programming (2001), 493\u015b544.","journal-title":"International Journal of Parallel Programming ("},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61739-6_33"},{"key":"e_1_2_2_5_1","first-page":"26","article-title":"2016a","author":"Bao W.","year":"2016","unstructured":"W. Bao , C. Hong , S. Chunduri , S. Krishnamoorthy , N. Pouchet , F. Rastello , and P. Sadayappan . 2016a . Static and Dynamic Frequency Scaling on Multicore CPUs. ACM Transactions on Architecture and Code Optimization ( 2016 ), 1\u015b 26 . W. Bao, C. Hong, S. Chunduri, S. Krishnamoorthy, N. Pouchet, F. Rastello, and P. Sadayappan. 2016a. Static and Dynamic Frequency Scaling on Multicore CPUs. ACM Transactions on Architecture and Code Optimization (2016), 1\u015b26.","journal-title":"Static and Dynamic Frequency Scaling on Multicore CPUs. ACM Transactions on Architecture and Code Optimization ("},{"key":"e_1_2_2_6_1","volume-title":"PolyCheck: Dynamic Veriication of Iteration Space Transformations on Aine Programs. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201916)","author":"Bao W.","year":"2016","unstructured":"W. Bao , S. Krishnamoorthy , L. Pouchet , F. Rastello , and P. Sadayappan . 2016b . PolyCheck: Dynamic Veriication of Iteration Space Transformations on Aine Programs. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201916) ( 2016 ), 539\u015b554. W. Bao, S. Krishnamoorthy, L. Pouchet, F. Rastello, and P. Sadayappan. 2016b. PolyCheck: Dynamic Veriication of Iteration Space Transformations on Aine Programs. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201916) (2016), 539\u015b554."},{"key":"e_1_2_2_7_1","volume-title":"Eicient Cache Simulation for Aine Computations. In International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201917)","author":"Bao W.","unstructured":"W. Bao , P. Rawat , M. Kong , S. Krishnamoorthy , L. Pouchet , and P. Sadayappan . 2017 . Eicient Cache Simulation for Aine Computations. In International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201917) . W. Bao, P. Rawat, M. Kong, S. Krishnamoorthy, L. Pouchet, and P. Sadayappan. 2017. Eicient Cache Simulation for Aine Computations. In International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201917)."},{"key":"e_1_2_2_8_1","volume-title":"PWCET: Power-Aware Worst Case Execution Time Analysis. In 43rd International Conference on Parallel Processing Workshops. 439\u015b447","author":"Bao W.","unstructured":"W. Bao , S. Tavarageri , F. Ozguner , and P. Sadayappan . 2014 . PWCET: Power-Aware Worst Case Execution Time Analysis. In 43rd International Conference on Parallel Processing Workshops. 439\u015b447 . W. Bao, S. Tavarageri, F. Ozguner, and P. Sadayappan. 2014. PWCET: Power-Aware Worst Case Execution Time Analysis. In 43rd International Conference on Parallel Processing Workshops. 439\u015b447."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2004.1291352"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004"},{"key":"e_1_2_2_11_1","volume-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201908)","author":"Bondhugula U.","unstructured":"U. Bondhugula , A. Hartono , J. Ramanujam , and P. Sadayappan . 2008. A Practical Automatic Polyhedral Program Optimization System . In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201908) . U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan. 2008. A Practical Automatic Polyhedral Program Optimization System. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201908)."},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"T. Carlson W. Heirman S. Eyerman I. Hur and L. Eeckhout. 2014. An Evaluation of High-Level Mechanistic Core Models. ACM Transactions on Architecture and Code Optimization (2014).  T. Carlson W. Heirman S. Eyerman I. Hur and L. Eeckhout. 2014. An Evaluation of High-Level Mechanistic Core Models. ACM Transactions on Architecture and Code Optimization (2014).","DOI":"10.1145\/2629677"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/195473.195557"},{"key":"e_1_2_2_14_1","volume-title":"17th Annual International Conference on Supercomputing (ICS\u201903)","author":"Cascaval C.","unstructured":"C. Cascaval and A. Padua . 2003. Estimating cache misses and locality using stack distances . In 17th Annual International Conference on Supercomputing (ICS\u201903) . 150\u015b159. C. Cascaval and A. Padua. 2003. Estimating cache misses and locality using stack distances. In 17th Annual International Conference on Supercomputing (ICS\u201903). 150\u015b159."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378859"},{"key":"e_1_2_2_16_1","unstructured":"J. Edler and M. Hill. 1999. Dinero IV Trace-Driven Uniprocessor Cache Simulator. http:\/\/pages.cs.wisc.edu\/~markhill\/ DineroIV  J. Edler and M. Hill. 1999. Dinero IV Trace-Driven Uniprocessor Cache Simulator. http:\/\/pages.cs.wisc.edu\/~markhill\/ DineroIV"},{"key":"e_1_2_2_17_1","volume-title":"International Conference on Parallel Architectures and Compilation Techniques (PACT\u201905)","author":"Fang C.","unstructured":"C. Fang , S. Can , S. Onder , and Z. Wang . 2005. Instruction based memory distance analysis and its application to optimization . In International Conference on Parallel Architectures and Compilation Techniques (PACT\u201905) . 27\u015b37. C. Fang, S. Can, S. Onder, and Z. Wang. 2005. Instruction based memory distance analysis and its application to optimization. In International Conference on Parallel Architectures and Compilation Techniques (PACT\u201905). 27\u015b37."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065895.1065906"},{"key":"e_1_2_2_19_1","volume-title":"International Journal of Parallel Programming","author":"Feautrier P.","year":"1992","unstructured":"P. Feautrier . 1992. Some eicient solutions to the aine scheduling problem, part II: multidimensional time . International Journal of Parallel Programming ( 1992 ), 389\u015b420. P. Feautrier. 1992. Some eicient solutions to the aine scheduling problem, part II: multidimensional time. International Journal of Parallel Programming (1992), 389\u015b420."},{"key":"e_1_2_2_20_1","volume-title":"International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201991)","author":"Ferrante J.","unstructured":"J. Ferrante , V. Sarkar , and W. Thrash . 1991. On estimating and enhancing cache efectiveness . In International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201991) . 328\u015b343. J. Ferrante, V. Sarkar, and W. Thrash. 1991. On estimating and enhancing cache efectiveness. In International Workshop on Languages and Compilers for Parallel Computing (LCPC\u201991). 328\u015b343."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.1999.807544"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"B. Fraguela R. Doallo and L. Zapata. 2003. Probabilistic miss equations: Evaluating memory hierarchy performance. IEEE Trans. Comput. (2003) 321\u015b336.  B. Fraguela R. Doallo and L. Zapata. 2003. Probabilistic miss equations: Evaluating memory hierarchy performance. IEEE Trans. Comput. (2003) 321\u015b336.","DOI":"10.1109\/TC.2003.1183947"},{"key":"e_1_2_2_23_1","first-page":"453","article-title":"Van W. 2002. Tight bounds on cache use for stencil operations on rectangular grids","author":"Frumkin A.","year":"2002","unstructured":"A. Frumkin and Rob F . Van W. 2002. Tight bounds on cache use for stencil operations on rectangular grids . J. ACM ( 2002 ), 434\u015b 453 . A. Frumkin and Rob F. Van W. 2002. Tight bounds on cache use for stencil operations on rectangular grids. J. ACM (2002), 434\u015b453.","journal-title":"J. ACM ("},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291051"},{"key":"e_1_2_2_25_1","first-page":"746","article-title":"1999. Cache miss equations: a compiler framework for analyzing and tuning memory behavior","author":"Ghosh S.","year":"1999","unstructured":"S. Ghosh , M. Martonosi , and S. Malik . 1999. Cache miss equations: a compiler framework for analyzing and tuning memory behavior . ACM Transactions on Programming Languages and Systems ( 1999 ), 703\u015b 746 . S. Ghosh, M. Martonosi, and S. Malik. 1999. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems (1999), 703\u015b746.","journal-title":"ACM Transactions on Programming Languages and Systems ("},{"key":"e_1_2_2_26_1","first-page":"317","article-title":"2006","author":"Girbal S.","year":"2006","unstructured":"S. Girbal , N. Vasilache , C. Bastoul , A. Cohen , D. Parello , M. Sigler , and O. Temam . 2006 . Semi-Automatic Composition of Loop Transformations. International Journal of Parallel Programming ( 2006 ), 261\u015b 317 . S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. 2006. Semi-Automatic Composition of Loop Transformations. International Journal of Parallel Programming (2006), 261\u015b317.","journal-title":"Semi-Automatic Composition of Loop Transformations. International Journal of Parallel Programming ("},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"S. Harper J. Kerbyson and R. Nudd. 1999. Analytical modeling of set-associative cache behavior. IEEE Trans. Comput. (1999) 1009\u015b1024.  S. Harper J. Kerbyson and R. Nudd. 1999. Analytical modeling of set-associative cache behavior. IEEE Trans. Comput. (1999) 1009\u015b1024.","DOI":"10.1109\/12.805152"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"D. Hill and J. Smith. 1989. Evaluating associativity in CPU caches. IEEE Trans. Comput. (1989) 1612\u015b1630.  D. Hill and J. Smith. 1989. Evaluating associativity in CPU caches. IEEE Trans. Comput. (1989) 1612\u015b1630.","DOI":"10.1109\/12.40842"},{"key":"e_1_2_2_29_1","volume-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201916)","author":"Hong C.","year":"2016","unstructured":"C. Hong , W. Bao , A. Cohen , S. Krishnamoorthy , L. Pouchet , F. Rastello , J. Ramanujam , and P. Sadayappan . 2016. Efective Padding of Multidimensional Arrays to Avoid Cache Conlict Misses . ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201916) ( 2016 ), 129\u015b144. C. Hong, W. Bao, A. Cohen, S. Krishnamoorthy, L. Pouchet, F. Rastello, J. Ramanujam, and P. Sadayappan. 2016. Efective Padding of Multidimensional Arrays to Avoid Cache Conlict Misses. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201916) (2016), 129\u015b144."},{"key":"e_1_2_2_30_1","unstructured":"W. Kelly and W. Pugh. 1993. A Framework for Unifying Reordering Transformations. Technical Report.  W. Kelly and W. Pugh. 1993. A Framework for Unifying Reordering Transformations. Technical Report."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462187"},{"key":"e_1_2_2_32_1","volume-title":"Maximizing Parallelism and Minimizing Synchronization with Aine Transforms. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201997)","author":"Lim W.","unstructured":"W. Lim and S. Lam . 1997 . Maximizing Parallelism and Minimizing Synchronization with Aine Transforms. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201997) . 201\u015b214. W. Lim and S. Lam. 1997. Maximizing Parallelism and Minimizing Synchronization with Aine Transforms. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201997). 201\u015b214."},{"key":"e_1_2_2_33_1","unstructured":"C. Oppen. 1978. A 2 2 2pn upper bound on the complexity of Presburger arithmetic. J. Comput. System Sci. (1978) 323\u015b332.  C. Oppen. 1978. A 2 2 2pn upper bound on the complexity of Presburger arithmetic. J. Comput. System Sci. (1978) 323\u015b332."},{"key":"e_1_2_2_34_1","unstructured":"L. Pouchet. 2017a. PoCC the Polyhedral Compiler Collection 1.4. http:\/\/pocc.sourceforge.net  L. Pouchet. 2017a. PoCC the Polyhedral Compiler Collection 1.4. http:\/\/pocc.sourceforge.net"},{"key":"e_1_2_2_35_1","unstructured":"L. Pouchet. 2017b. PolyBench\/C 4.0. http:\/\/polybench.sourceforge.net  L. Pouchet. 2017b. PolyBench\/C 4.0. http:\/\/polybench.sourceforge.net"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2005.12"},{"key":"e_1_2_2_37_1","volume-title":"ACM SIGPLAN conference on Programming language design and implementation (PLDI\u201998)","author":"Rivera G.","unstructured":"G. Rivera and C. Tseng . 1998. Data transformations for eliminating conlict misses . In ACM SIGPLAN conference on Programming language design and implementation (PLDI\u201998) . 38\u015b49. G. Rivera and C. Tseng. 1998. Data transformations for eliminating conlict misses. In ACM SIGPLAN conference on Programming language design and implementation (PLDI\u201998). 38\u015b49."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2000.842294"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28652-0_6"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755888.1755910"},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"P. Singh S. Stone and F. Thiebaut. 1992. A model of workloads and its use in miss-rate prediction for fully associative caches. IEEE Trans. Comput. (1992) 811\u015b825.  P. Singh S. Stone and F. Thiebaut. 1992. A model of workloads and its use in miss-rate prediction for fully associative caches. IEEE Trans. Comput. (1992) 811\u015b825.","DOI":"10.1109\/12.256450"},{"key":"e_1_2_2_42_1","doi-asserted-by":"crossref","unstructured":"M. Valiev J. Bylaska N. Govind K. Kowalski Tjerk P. Straatsma Hubertus J J. Van D. D. Wang J. Nieplocha E. Apra L. Windus etal 2010. NWChem: a comprehensive and scalable open-source solution for large scale molecular simulations. Computer Physics Communications (2010) 1477\u015b1489.  M. Valiev J. Bylaska N. Govind K. Kowalski Tjerk P. Straatsma Hubertus J J. Van D. D. Wang J. Nieplocha E. Apra L. Windus et al. 2010. NWChem: a comprehensive and scalable open-source solution for large scale molecular simulations. Computer Physics Communications (2010) 1477\u015b1489.","DOI":"10.1016\/j.cpc.2010.04.018"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2003.1238003"},{"key":"e_1_2_2_44_1","first-page":"987","article-title":"2005","author":"Vera X.","year":"2005","unstructured":"X. Vera , J. Abella , J. Llosa , and A. Gonz\u00e1lez . 2005 . An Accurate Cost Model for Guiding Data Locality Transformations. ACM Transactions on Programming Languages and Systems ( 2005 ), 946\u015b 987 . X. Vera, J. Abella, J. Llosa, and A. Gonz\u00e1lez. 2005. An Accurate Cost Model for Guiding Data Locality Transformations. ACM Transactions on Programming Languages and Systems (2005), 946\u015b987.","journal-title":"ACM Transactions on Programming Languages and Systems ("},{"key":"e_1_2_2_45_1","first-page":"300","article-title":"2004. A fast and accurate framework to analyze and optimize cache memory behavior","author":"Vera X.","year":"2004","unstructured":"X. Vera , N. Bermudo , J. Llosa , and A. Gonz\u00e1lez . 2004. A fast and accurate framework to analyze and optimize cache memory behavior . ACM Transactions on Programming Languages and Systems ( 2004 ), 263\u015b 300 . X. Vera, N. Bermudo, J. Llosa, and A. Gonz\u00e1lez. 2004. A fast and accurate framework to analyze and optimize cache memory behavior. ACM Transactions on Programming Languages and Systems (2004), 263\u015b300.","journal-title":"ACM Transactions on Programming Languages and Systems ("},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2002.995708"},{"key":"e_1_2_2_47_1","unstructured":"S. Verdoolaege. 2007. Barvinok a library for counting the integer points in parametric and non-parametric polytopes. http:\/\/barvinok.gforge.inria.fr  S. Verdoolaege. 2007. Barvinok a library for counting the integer points in parametric and non-parametric polytopes. http:\/\/barvinok.gforge.inria.fr"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"e_1_2_2_49_1","unstructured":"S. Verdoolaege. 2010b. ISL the Integer Set Library. http:\/\/repo.or.cz\/w\/isl.git  S. Verdoolaege. 2010b. ISL the Integer Set Library. http:\/\/repo.or.cz\/w\/isl.git"},{"key":"e_1_2_2_50_1","volume-title":"2nd International Workshop on Polyhedral Compilation Techniques.","author":"Verdoolaege S.","unstructured":"S. Verdoolaege and T. Grosser . 2012. Polyhedral extraction tool . In 2nd International Workshop on Polyhedral Compilation Techniques. S. Verdoolaege and T. Grosser. 2012. Polyhedral extraction tool. In 2nd International Workshop on Polyhedral Compilation Techniques."},{"key":"e_1_2_2_51_1","doi-asserted-by":"crossref","unstructured":"S. Verdoolaege R. Seghir K. Beyls V. Loechner and M. Bruynooghe. 2007. Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica (2007) 37\u015b66.  S. Verdoolaege R. Seghir K. Beyls V. Loechner and M. Bruynooghe. 2007. Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica (2007) 37\u015b66.","DOI":"10.1007\/s00453-006-1231-0"},{"key":"e_1_2_2_52_1","volume-title":"Eicient Trace-driven Simulation Method for Cache Performance Analysis. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS\u201990)","author":"Wang W.","unstructured":"W. Wang and L. Baer . 1990 . Eicient Trace-driven Simulation Method for Cache Performance Analysis. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS\u201990) . 27\u015b36. W. Wang and L. Baer. 1990. Eicient Trace-driven Simulation Method for Cache Performance Analysis. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS\u201990). 27\u015b36."},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"J. Xue and X. Vera. 2004. Eicient and accurate analytical modeling of whole-program data cache behavior. IEEE Trans. Comput. (2004) 547\u015b566.  J. Xue and X. Vera. 2004. Eicient and accurate analytical modeling of whole-program data cache behavior. IEEE Trans. Comput. (2004) 547\u015b566.","DOI":"10.1109\/TC.2004.1275296"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/DFTVS.2005.23"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3158120","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3158120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:30Z","timestamp":1750212690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":54,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1145\/3158120"],"URL":"https:\/\/doi.org\/10.1145\/3158120","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]},"assertion":[{"value":"2017-12-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}