{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:44Z","timestamp":1725740504369},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_36","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"415-426","source":"Crossref","is-referenced-by-count":3,"title":["Tight Bounds for Low Dimensional Star Stencils in the External Memory Model"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Hupp","sequence":"first","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"36_CR1","first-page":"1116","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun.\u00a0ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Commun.\u00a0ACM"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: Proc. of SPAA 2008. ACM (2008)","DOI":"10.1145\/1378533.1378573"},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1137\/090769156","volume":"32","author":"G. Ballard","year":"2011","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Minimizing communication in numerical linear algebra. SIAM J. Matrix Analysis Appl.\u00a032(3), 866\u2013901 (2011)","journal-title":"SIAM J. Matrix Analysis Appl."},{"issue":"6","key":"36_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2395116.2395121","volume":"59","author":"G. Ballard","year":"2012","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM\u00a059(6), 32 (2012)","journal-title":"J. ACM"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. J. Algorithms, 1\u201316 (1998)","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0403004","volume":"3","author":"B. Bollob\u00e1s","year":"1990","unstructured":"Bollob\u00e1s, B., Leader, I.: An isoperimetric inequality on the discrete torus. SIAM J. Discret. Math.\u00a03, 32\u201337 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/070693199","volume":"51","author":"K. Datta","year":"2009","unstructured":"Datta, K., Kamil, S., Williams, S., Oliker, L., Shalf, J., Yelick, K.: Optimization and performance modeling of stencil computations on modern microprocessors. SIAM Rev.\u00a051(1), 129\u2013159 (2009)","journal-title":"SIAM Rev."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Strumpen, V.: Cache oblivious stencil computations. In: Proc. of 19th Annual ICS 2005, ICS 2005, pp. 361\u2013366. ACM (2005)","DOI":"10.1145\/1088149.1088197"},{"issue":"2","key":"36_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11227-007-0111-y","volume":"39","author":"M. Frigo","year":"2007","unstructured":"Frigo, M., Strumpen, V.: The memory behavior of cache oblivious stencil computations. J. Supercomput.\u00a039(2), 93\u2013112 (2007)","journal-title":"J. Supercomput."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/567112.567115","volume":"49","author":"M.A. Frumkin","year":"2002","unstructured":"Frumkin, M.A., Van der Wijngaart, R.F.: Tight bounds on cache use for stencil operations on rectangular grids. J. ACM\u00a049, 434\u2013453 (2002)","journal-title":"J. ACM"},{"key":"36_CR11","first-page":"326","volume-title":"Proceedings of STOC 1981","author":"J.-W. Hong","year":"1981","unstructured":"Hong, J.-W., Kung, H.T.: I\/O complexity: The red-blue pebble game. In: Proceedings of STOC 1981, pp. 326\u2013333. ACM, New York (1981)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Hupp, P., Jacob, R.: Tight bounds for low dimensional star stencils in the external memory model. CoRR, abs\/1205.0606 (2012)","DOI":"10.1007\/978-3-642-40104-6_36"},{"issue":"9","key":"36_CR13","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.jpdc.2004.03.021","volume":"64","author":"D. Irony","year":"2004","unstructured":"Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput.\u00a064(9), 1017\u20131026 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Leopold, C.: An analytical evaluation of tiling for stencil codes with time loop. In: Proc. of the 16th IPDPS. IEEE Computer Society (2002)","DOI":"10.1109\/IPDPS.2002.1016538"},{"key":"36_CR15","unstructured":"Leopold, C.: On optimal locality of linear relaxation. In: Proc. Int. Symp. on Parallel and Distributed Computing and Network, IASTED, pp. 201\u2013206 (2002)"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/3-540-46043-8_85","volume-title":"Computational Science - ICCS 2002","author":"C. Leopold","year":"2002","unstructured":"Leopold, C.: Tight bounds on capacity misses for 3D stencil codes. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002, Part I. LNCS, vol.\u00a02329, pp. 843\u2013852. Springer, Heidelberg (2002)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Tang, Y., Chowdhury, R.A., Kuszmaul, B.C., Luk, C.-K., Leiserson, C.E.: The pochoir stencil compiler. In: Proceedings of SPAA 2011, pp. 117\u2013128. ACM (2011)","DOI":"10.1145\/1989493.1989508"},{"issue":"1-4","key":"36_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1504\/PCFD.2008.018088","volume":"8","author":"T. Zeiser","year":"2008","unstructured":"Zeiser, T., Wellein, G., Nitsure, A., Iglberger, K., R\u00fcde, U., Hager, G.: Introducing a parallel cache oblivious blocking approach for the lattice Boltzmann method. Progress in Computational Fluid Dynamics\u00a08(1-4), 179\u2013188 (2008)","journal-title":"Progress in Computational Fluid Dynamics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:43:29Z","timestamp":1557945809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}