{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:40Z","timestamp":1763467840697,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_11","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"128-139","source":"Crossref","is-referenced-by-count":13,"title":["A Characterization of Temporal Locality and Its Portability across Memory Hierarchies"],"prefix":"10.1007","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A.K. Chandra, M. Snir. A Model for Hierarchical Memory. Proc. 19th ACM Symp. Theory of Computing., (1987), 305\u2013314.","DOI":"10.1145\/28395.28428"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A.K. Chandra and M. Snir. Hierarchical Memory with Block Transfer. Proc. 28th Symp. Foundations of Comp. Science, (1987), 204\u2013216.","DOI":"10.1109\/SFCS.1987.31"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B. Alpern","year":"1994","unstructured":"B. Alpern, L. Carter, E. Feig and T. Selker. The Uniform Memory Hierarchy Model of Computation. Algorithmica, vol. 12, (1994), 72\u2013129.","journal-title":"Algorithmica"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","volume":"71","author":"A. Aggarwal","year":"1990","unstructured":"A. Aggarwal, A.K. Chandra and M. Snir. Communication Complexity of PRAMs. Theoretical Computer Science, vol.71, 3\u201328, 1990.","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"J. Bilmes, K. Asanovic, C. Chin and J. Demmel. Optimizing matrix multiply using PHiPAC: a portable, high-performance, Ansi C coding methodology. International Conference on Supercomputing, (1997).","DOI":"10.1145\/263580.263662"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"G. Bilardi, K. Ekanadham, P. Pattnaik Computational power of pipelined memory hierarchies. 13th ACM Symp. Par. Algorithms and Architectures, (2001).","DOI":"10.1145\/378580.378615"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"G. Bilardi, E. Peserico. An Approach towards an Analytical Characterization of Locality and its Portability. Proc. of International Workshop on Innovative Architectures 2000, IEEE CS Press, (2001).","DOI":"10.1109\/IWIA.2001.955195"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s002240000066","volume":"30","author":"G. Bilardi","year":"1997","unstructured":"G. Bilardi, F. Preparata Processor-time tradeoffunder bounded-speed message propagation. Part I: Upper bounds. Theory of Computing Systems, vol. 30, 523\u2013546, 1997. Part II: Lower bounds. Theory of Computing Systems, vol. 32, 531-559, 1999.","journal-title":"Theory of Computing Systems"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"G. Bilardi, A. Pietracaprina, and P. D\u2019Alberto. On the space and access complexity of computation dags. 26th Workshop on Graph-Theoretic Concepts in Comp. Science (2000).","DOI":"10.1007\/3-540-40064-8_6"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"M. Frigo and S.G. Johnson. FFTW: An Adaptive Software Architecture for the FFT. ICASSP, (1998), 1381\u20131384.","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. Frigo, C.E. Leiserson, H. Prokop and S. Ramachandran. Cache-Oblivious Algorithms. Proc. 40th Symp. Foundations of Comp. Science, (1999).","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Hong and H.T. Kung. I\/O Complexity: The Red-Blue Pebble Game. Proc. 13th ACM Symp. Theory of Computing, (1981), 326\u2013333.","DOI":"10.1145\/800076.802486"},{"key":"11_CR13","volume-title":"Computer Architecture A Quantitative Approach","author":"J.L. Hennessy","year":"1996","unstructured":"J.L. Hennessy and D.A. Patterson, Computer Architecture A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, 1996."},{"key":"11_CR14","unstructured":"V. Milutinovic and M. Valero (Guest Eds.) Special Issue on Cache Memory and Related Problems. IEEE Transactions on Computers, 1999."},{"key":"11_CR15","volume-title":"A Performance Directed Approach","author":"S.S. Przybylski","year":"1990","unstructured":"S.S. Przybylski. Cache and Memory Hierarchy Design. A Performance Directed Approach. Morgan Kaufmann Publishers, Inc. Palo Alto, CA 1990."},{"key":"11_CR16","unstructured":"E. Peserico. Performance Optimization on Hierarchical Memory. Laurea Thesis, Dip. di Elettronica ed Informatica, Universit\u00e0 di Padova, July 1998."},{"key":"11_CR17","volume-title":"Exploring the Power of Computing","author":"J.E. Savage","year":"1998","unstructured":"J.E. Savage. Models of Computation. Exploring the Power of Computing Addison-Wesley, Reading, MA, 1998."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, vol. 28(2) 202\u2013208, 1985.","journal-title":"Communications of the ACM"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"J.S. Vitter. External Memory Algorithms. Invited paper in Proc. 6th European Symp. on Algorithms, (G. Bilardi et al. Eds.), Springer Verlag, (1998), 1\u201325.","DOI":"10.1145\/275487.275501"},{"key":"11_CR20","unstructured":"M. Wolfe High Performance Compilers for Parallel Computing. Addison-Wesley, 1995."},{"key":"11_CR21","unstructured":"R.C. Whaley and J.J. Dongarra. Automatically Tuned Linear Algebra Software. http:\/\/www.netlib.org\/atlas\/index.html"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:35Z","timestamp":1737503375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}