{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T17:41:40Z","timestamp":1793122900795,"version":"4.5.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,2,21]],"date-time":"2007-02-21T00:00:00Z","timestamp":1172016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2007,3,16]]},"DOI":"10.1007\/s11227-007-0111-y","type":"journal-article","created":{"date-parts":[[2007,2,20]],"date-time":"2007-02-20T07:18:48Z","timestamp":1171955928000},"page":"93-112","source":"Crossref","is-referenced-by-count":36,"title":["The memory behavior of cache oblivious stencil computations"],"prefix":"10.1007","volume":"39","author":[{"given":"Matteo","family":"Frigo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volker","family":"Strumpen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,2,21]]},"reference":[{"key":"111_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Alpern B, Chandra AK, Snir M (1987) A model for hierarchical memory. In: 19th ACM symposium on theory of computing, New York, May 1987, pp 305\u2013314","DOI":"10.1145\/28395.28428"},{"issue":"9","key":"111_CR2","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal A, Vitter JS (1988) The input\/output complexity of sorting and related problems. Commun ACM 31(9):1116\u20131127","journal-title":"Commun ACM"},{"key":"111_CR3","doi-asserted-by":"crossref","unstructured":"Alpern B, Carter L, Ferrante J (1995) Space-limited procedures: a methodology for portable high-performance. In: Conference on programming models for massively parallel computers, Berlin, Germany, October 1995. IEEE Computer Society, pp 10\u201317","DOI":"10.1109\/PMMPC.1995.504336"},{"key":"111_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK users\u2019 guide","author":"E Anderson","year":"1999","unstructured":"Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J, Du Croz J, Greenbaum A, Hammarling S, McKenney A, Sorensen D (1999) LAPACK users\u2019 guide. Society for Industrial and Applied Mathematics, Philadelphia, 3rd edn. http:\/\/www.netlib.org\/lapack\/lug\/lapack_lug.html","edition":"3"},{"key":"111_CR5","doi-asserted-by":"crossref","unstructured":"Arge L, Bender MA, Demaine ED, Holland-Minkley B, Munro JI (2002) Cache-oblivious priority queue and graph algorithm applications. In: 34th ACM symposium on theory of computing. ACM Press, Montr\u00e9al, Canada, 2002, pp 268\u2013276","DOI":"10.1145\/509907.509950"},{"key":"111_CR6","doi-asserted-by":"crossref","unstructured":"Bailey DH (1993) RISC microprocessors and scientific computing. In: Supercomputing\u201993, Portland, OR, November 1993, pp 645\u2013654","DOI":"10.1145\/169627.169813"},{"key":"111_CR7","doi-asserted-by":"crossref","unstructured":"Bender MA, Demaine ED, Farach-Colton M (2000) Cache-oblivious B-trees. In: Symposium on foundations of computer science, IEEE Computer Society, Redondo Beach, CA, November 2000, pp 399\u2013409","DOI":"10.1109\/SFCS.2000.892128"},{"key":"111_CR8","doi-asserted-by":"crossref","unstructured":"Bilardi G, Preparata FP (1995) Upper bounds to processor-time tradeoffs under bounded-speed message propagation. In: 7th ACM symposium on parallel algorithms and architectures, ACM Press, Santa Barbara, 1995, pp 185\u2013194","DOI":"10.1145\/215399.215443"},{"key":"111_CR9","doi-asserted-by":"crossref","unstructured":"Blumofe RD, Frigo M, Joerg CF, Leiserson CE, Randall KH (1996) An analysis of dag-consistent distributed shared-memory algorithms. In: 8th ACM symposium on parallel algorithms and architectures, Padua, Italy, June 1996, pp 297\u2013308","DOI":"10.1145\/237502.237574"},{"issue":"4","key":"111_CR10","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/1054907.1054910","volume":"31","author":"P Bohrer","year":"2004","unstructured":"Bohrer P, Elnozahy M, Gheith A, Lefurgy C, Nakra T, Peterson J, Rajamony R, Rockhold R, Shafi H, Simpson R, Speight E, Sudeep K, Van Hensbergen E, Zhang L (2004) Mambo: a full system simulator for the PowerPC architecture. SIGMETRICS Perform Eval Rev 31(4):8\u201312","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"111_CR11","unstructured":"Brodal GS, Fagerberg R, Vinther K (2004) Engineering a cache-oblivious sorting algorithm. In: 6th Workshop on algorithm engineering and experiments SIAM, New Orleans, LA, January 2004, pp 4\u201317"},{"key":"111_CR12","first-page":"98","volume":"22","author":"S Chen","year":"1994","unstructured":"Chen S, Doolen GD, Eggert KG (1994) Lattice-Boltzmann fluid dynamics: a versatile tool for multiphase and other complicated flows. Los Alamos Sci 22:98\u201319","journal-title":"Los Alamos Sci"},{"key":"111_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK users\u2019 guide","author":"JJ Dongarra","year":"1979","unstructured":"Dongarra JJ, Moler CB, Bunch JR, Stewart GW (1979) LINPACK users\u2019 guide. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"111_CR14","doi-asserted-by":"crossref","unstructured":"Frigo M, Leiserson CE, Prokop H, Ramachandran S (1999) Cache-oblivious algorithms. In: 40th symposium on foundations of computer science, New York, NY, October 1999. ACM Press","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"111_CR15","doi-asserted-by":"crossref","unstructured":"Frigo M, Strumpen V (2005) Cache oblivious stencil computations. In: International conference on supercomputing, Boston, MA, June 2005. ACM Press, pp 361\u2013366","DOI":"10.1145\/1088149.1088197"},{"key":"111_CR16","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore","edition":"3"},{"key":"111_CR17","unstructured":"Goto K, van de Geijn R (2001) On Reducing TLB Misses in Matrix Multiplication. Technical Report TR-2002-55, Department of Computer Sciences, The University of Texas at Austin (FLAME Working Note #9)"},{"key":"111_CR18","unstructured":"Hong J-W, Kung HT (1981) I\/O complexity: the red-blue pebbling game. In: 13th ACM Symposium on Theory of Computing, Milwaukee, WI, May 1981, pp 326\u2013333"},{"key":"111_CR19","unstructured":"Kowarschik M (2004) Data locality optimizations for iterative numerical algorithms and cellular automata on hierarchical memory architectures. PhD thesis, Lehrstuhl f\u00fcr Informatik 10 (Systemsimulation), Institut f\u00fcr Informatik, Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany, July 2004"},{"key":"111_CR20","unstructured":"Macnab A, Vahala G, Vahala L, Pavlo P (2002) Lattice Boltzmann model for dissipative MHD. In: 29th EPS conference on controlled fusion and plasma physics, vol 26B, Montreux, Switzerland, June 2002"},{"key":"111_CR21","unstructured":"Oliker L, Canning A, Carter J, Shalf J, Ethier S (2004) Scientific computations on modern parallel vector systems. In: Supercomputing\u201904, Pittsburgh, PA, November 2004, IEEE. http:\/\/www.sc-conference.org\/sc2004\/papers.html"},{"key":"111_CR22","unstructured":"Pohl T, Deserno F, Th\u00fcrey N, R\u00fcde U, Lammers P, Wellein G, Zeiser T (2004) Performance evaluation of parallel large-scale lattice Boltzmann applications on three supercomputing architectures. In: Supercomputing\u201904, Pittsburgh, PA, November 2004, IEEE. http:\/\/www.sc-conference.org\/sc2004\/papers.html"},{"key":"111_CR23","unstructured":"Prokop H (1999) Cache-oblivious algorithms. Master\u2019s thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, June 1999"},{"key":"111_CR24","volume-title":"Numerical solution of partial differential equations: finite difference methods","author":"GD Smith","year":"1985","unstructured":"Smith GD (1985) Numerical solution of partial differential equations: finite difference methods, 3rd edn. Oxford University Press, Oxford","edition":"3"},{"issue":"4","key":"111_CR25","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1137\/S0895479896297744","volume":"18","author":"S Toledo","year":"1997","unstructured":"Toledo S (1997) Locality of reference in LU decomposition with partial pivoting. SIAM J Matrix Anal Appl 18(4):1065\u20131081","journal-title":"SIAM J Matrix Anal Appl"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0111-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0111-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0111-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:23:55Z","timestamp":1559370235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0111-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,21]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,16]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0111-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,21]]}}}