{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T05:27:31Z","timestamp":1657603651929},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,2,24]],"date-time":"2007-02-24T00:00:00Z","timestamp":1172275200000},"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-0106-8","type":"journal-article","created":{"date-parts":[[2007,2,23]],"date-time":"2007-02-23T22:18:52Z","timestamp":1172269132000},"page":"227-249","source":"Crossref","is-referenced-by-count":2,"title":["Cache oblivious algorithms for nonserial polyadic programming"],"prefix":"10.1007","volume":"39","author":[{"given":"Guangming","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengzhong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninghui","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,24]]},"reference":[{"key":"106_CR1","doi-asserted-by":"crossref","unstructured":"Arge L, Bender MA, Demaine ED, Minkley BH, Munro JI (2002) Cache-oblivious priority queue and graph algorithm applications. In: ACM STOC\u201902, pp 268\u2013276","DOI":"10.1145\/509907.509950"},{"key":"106_CR2","doi-asserted-by":"crossref","unstructured":"Chilimbi T, Hill M, Larus J (1999) Cache-conscious structure layout. In: Proceedings of ACM SIGPLAN conf programming language design and implementation, 1999","DOI":"10.1145\/301618.301633"},{"key":"106_CR3","doi-asserted-by":"crossref","unstructured":"Chowdhury RA, Ramachandran V (2004) Cache-oblivious shortest paths in graphs using buffer heap. In: ACM SPAA\u201904, pp 245\u2013254","DOI":"10.1145\/1007912.1007949"},{"issue":"2","key":"106_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/JPROC.2004.840848","volume":"93","author":"J Demmel","year":"2005","unstructured":"Demmel J, Dongarra J, Eijkhout V et al (2005) Self-adapting linear algebra algorithms and software. Proc IEEE 93(2):293\u2013312","journal-title":"Proc IEEE"},{"issue":"2","key":"106_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M Frigo","year":"2005","unstructured":"Frigo M, Johnson SG (2005) The design and implementation of FFTW3. Proc IEEE 93(2):216\u2013231","journal-title":"Proc IEEE"},{"key":"106_CR6","doi-asserted-by":"crossref","unstructured":"Frigo M, Leiserson CE, Prokop H, Ramachandran S (1999) Cache-oblivious algorithm. In: Proceedings of the 40th annual symposium on foundations of computer science, 1999, pp 285\u2013297","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"106_CR7","unstructured":"Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing. Addison-Wesley"},{"issue":"12","key":"106_CR8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/2.546613","volume":"29","author":"MW Hall","year":"1996","unstructured":"Hall MW, Anderson JM, Amarasinghe SP, Murphy BR, Liao S-W, Bugnion E, Lam MS (1996) Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer 29(12):84\u201389","journal-title":"IEEE Computer"},{"key":"106_CR9","unstructured":"Kallahalla M, Varman PJ (2001) Optimal prefetching and caching for parallel I\/O systems. In: Proceedings of 13th ACM symposium on parallel algorithms and architectures, 2001"},{"key":"106_CR10","doi-asserted-by":"crossref","unstructured":"Lam M, Rothberg E, Wolf M (1991) The cache performance and optimizations of blocked algorithms. In: Proceedings of 14th int\u2019l conference on architectural support for programming languages and operating systems, 1991","DOI":"10.1145\/106972.106981"},{"issue":"4","key":"106_CR11","first-page":"1","volume":"1","author":"A LaMarca","year":"1996","unstructured":"LaMarca A, Ladner R (1996) The influence of caches on the performance of heaps. ACM J Exp Algorithm 1(4):1\u20134","journal-title":"ACM J Exp Algorithm"},{"issue":"6","key":"106_CR12","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/15.6.440","volume":"15","author":"RB Lyngso","year":"1999","unstructured":"Lyngso RB, Zuker M (1999) Fast evaluation of internal loops in RNA secondary structure prediction. Bioinformatics 15(6):440\u2013445","journal-title":"Bioinformatics"},{"issue":"7","key":"106_CR13","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1109\/TPDS.2003.1214317","volume":"14","author":"N Park","year":"2003","unstructured":"Park N, Hong B, Prasanna VK (2003) Tiling, block data layout, and memory hierarchy performance. IEEE Trans Parallel Distrib Syst 14(7):640\u2013654","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"106_CR14","doi-asserted-by":"crossref","unstructured":"Park JS, Penner M, Prasanna VK (2004) Optimizing graph algorithms for improved cache performance. IEEE Trans Parallel Distrib Syst 15(9)","DOI":"10.1109\/TPDS.2004.44"},{"issue":"2","key":"106_CR15","first-page":"232","volume":"93","author":"M Puschel","year":"2005","unstructured":"Puschel M, Moura JMF, Johnson J, Padua D, Veloso M, Singer B, Xiong J, Franchetti F, Gacic A, Voronenko Y, Chen K, Johnson RW, Rizzolo N (2005) SPIRAL: code generation for DSP transforms. Proc IEEE, special issue on Program Generation, Optimization, and Adaptation 93(2):232\u2013275","journal-title":"Proc IEEE, special issue on Program Generation, Optimization, and Adaptation"},{"key":"106_CR16","unstructured":"Rastello F, Robert Y (1998) Loop partitioning versus tiling for cache-based multiprocessors. In: Procedings of int\u2019l conference on parallel and distributed computing and systems, 1998"},{"issue":"1","key":"106_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1981","unstructured":"Smith TF, Waterman MS (1981) Identification of common molecular subsequences. J Mol Biol 147(1):195\u2013197","journal-title":"J Mol Biol"},{"key":"106_CR18","unstructured":"Sterling TL, Zima HP (2002) The Gilgamesh: MIND processor-in-memory architecture for petaflops-scale computing. In: Supercomputing 2002, pp 1\u201323"},{"issue":"4","key":"106_CR19","first-page":"1","volume":"8","author":"G Venkataraman","year":"2003","unstructured":"Venkataraman G, Sahni S, Mukhopadhyaya S (2003) A blocked all-pairs shortest-paths algorithm. ACM J Exp Algorithm 8(4):1\u20134","journal-title":"ACM J Exp Algorithm"},{"key":"106_CR20","doi-asserted-by":"crossref","unstructured":"Wulf WA, McKee SA (1995) Hitting the memory wall: implications of the obvious. ACM SIGARCH Computer Architecture News 23(1)","DOI":"10.1145\/216585.216588"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0106-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0106-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0106-8","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-0106-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,24]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,16]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0106-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,24]]}}}