{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:58:24Z","timestamp":1705017504454},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T00:00:00Z","timestamp":1283817600000},"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":[[2012,2]]},"DOI":"10.1007\/s11227-010-0474-3","type":"journal-article","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T10:28:59Z","timestamp":1283768939000},"page":"830-851","source":"Crossref","is-referenced-by-count":8,"title":["A data locality methodology for matrix\u2013matrix multiplication algorithm"],"prefix":"10.1007","volume":"59","author":[{"given":"Nicolaos","family":"Alachiotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios I.","family":"Kelefouras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George S.","family":"Athanasiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harris E.","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angeliki S.","family":"Kritikakou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas E.","family":"Goutis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,7]]},"reference":[{"key":"474_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/cpe.549","volume":"13","author":"D Aberdeen","year":"2001","unstructured":"Aberdeen D, Baxter J (2001) Emmerald: a fast matrix\u2014matrix multiply using Intel\u2019s SSE instructions. Concurr Comput Pract Exp 13:103\u2013119. doi: 10.1002\/cpe.549","journal-title":"Concurr Comput Pract Exp"},{"key":"474_CR2","volume-title":"Optimizing compilers for modern architectures. A dependence based approach","author":"R Allen","year":"2002","unstructured":"Allen R, Kennedy K (2002) Optimizing compilers for modern architectures. A dependence based approach. Morgan Kaufmann, San Mateo, 454 pp"},{"key":"474_CR3","unstructured":"ATLAS FAQ (2010) Available at http:\/\/math-atlas.sourceforge.net\/faq.html#auth"},{"key":"474_CR4","doi-asserted-by":"crossref","unstructured":"Bilmes J, Asanovic K, Chin C, Demmel J (1997) Optimizing matrix multiply using PHiPAC: a\u00a0portable, high-performance, ANSI C coding methodology. In: Proc of the 11th ACM Int Conf Supercomput (ICS), July, pp 340\u2013347","DOI":"10.1145\/263580.263662"},{"key":"474_CR5","unstructured":"Burger D, Austin TM (1997) The SimpleSalar tool set, Version 2.0. Technical Report #1342"},{"key":"474_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee S, Thottethodi M (1998) Tuning Strassen\u2019s matrix multiplication for memory efficiency. In: Proc of 1998 ACM\/IEEE conf supercomput, San Jose, CA, pp 1\u201314 (CD-ROM)","DOI":"10.1109\/SC.1998.10045"},{"key":"474_CR7","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TPDS.2002.1058095","volume":"13","author":"S Chatterjee","year":"2002","unstructured":"Chatterjee S, Lebeck AR, Patnala PK, Thotterhodi M (2002) Recursive array layouts and fast matrix multiplication. IEEE Trans Parallel Distrib Syst 13:1105\u20131123. doi: 10.1109\/TPDS.2002.1058095","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"474_CR8","doi-asserted-by":"crossref","unstructured":"D\u2019Alberto P, Nicolau A (2005) Adaptive Strassen and ATLAS\u2019s DGEMM: a fast square-matrix multiply for modern high-performance systems. In: Proc of eighth int conf high-perform comput, Asia-Pacific region, November 30\u2013December 03, p 45. doi: 10.1109\/HPCASIA.2005.18","DOI":"10.1109\/HPCASIA.2005.18"},{"key":"474_CR9","unstructured":"Fischer PC, Probert RL (1974) Efficient procedures for using matrix algorithms. In: Proc of 2nd colloq autom, lang program and Lecture Notes in Computer Science, vol 14, pp 413\u2013427"},{"key":"474_CR10","unstructured":"Frens JD, Wise DS (1997) Auto-blocking matrix-multiplication or tracking BLAS3 performance with source code. In: Proc of the 6th ACM SIGPLAN symp princ pract parallel program. Las Vegas, NV, June, pp 206\u2013216"},{"key":"474_CR11","doi-asserted-by":"crossref","unstructured":"Frigo M (1999) A fast Fourier transform compiler. In: Proc of programing language design and implementation. Proc of ACM SIGPLAN 1999 conf program lang des implement, pp 169\u2013180","DOI":"10.1145\/301618.301661"},{"key":"474_CR12","doi-asserted-by":"crossref","unstructured":"Huss-Lederman S, Jacobson EM, Johnson JR, Tsao A, Turnbull T (1996) Implementation of Strassen\u2019s algorithm for matrix multiplication. In: Proc of ACM\/IEEE conf supercomput, Pittsburgh, Pennsylvania, USA (CD-ROM). doi: 10.1145\/369028.369096","DOI":"10.1145\/369028.369096"},{"key":"474_CR13","unstructured":"Intel homepage (2010). Available at http:\/\/www.intel.com\/cd\/products\/services\/emea\/eng\/319641.htm"},{"key":"474_CR14","unstructured":"Li X, Garzaran MJ (2005) Optimizing matrix multiplication with a classifier learning system. In: Proc of lang compil parallel comput (LCPC 2005), Hawthorne, NY, USA, October 20\u201322"},{"key":"474_CR15","unstructured":"MIPS Technologies homepage (2010). Available at http:\/\/www.mips.com\/products\/cores\/32-64-bit-cores\/mips32-74k\/"},{"key":"474_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G Peano","year":"1890","unstructured":"Peano G (1890) Sur une courbe qui remplit toute une aire plaine. Math Ann 36:157\u2013160. doi: 10.1007\/BF01199438","journal-title":"Math Ann"},{"key":"474_CR17","unstructured":"Price C (1995) MIPS IV Instruction set, revision 3.1. MIPS Technologies, Inc., Mountain View, CA, January"},{"key":"474_CR18","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-filling curves","author":"H Sagan","year":"1994","unstructured":"Sagan H (1994) Space-filling curves. Springer, London, ISBN 0-387-94265-3","ISBN":"http:\/\/id.crossref.org\/isbn\/0387942653"},{"key":"474_CR19","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13:354\u2013356","journal-title":"Numer Math"},{"key":"474_CR20","doi-asserted-by":"crossref","unstructured":"Thottethodi M, Chatterjee S, Lebeck AR (1998) Tuning Strassen\u2019s matrix multiplication for memory efficiency. In: Proc of SC98, Orlando, FL, Nov (CD-ROM). Available from http:\/\/www.supercomp.org\/sc98\/papers\/","DOI":"10.1109\/SC.1998.10045"},{"key":"474_CR21","unstructured":"Ubuntu manuals homepage (2010). Available at http:\/\/manpages.ubuntu.com\/manpages\/karmic\/man1\/time.1.html"},{"key":"474_CR22","unstructured":"Whaley CR (2008) User contribution to ATLAS. Available at http:\/\/modular.math.washington.edu\/home\/kirkby\/ATLAS\/doc\/atlas_contrib.pdf"},{"key":"474_CR23","unstructured":"Whaley CR (2008) ATLAS installation guide. Available at http:\/\/venom.cs.utsa.edu\/dmz\/techrep\/2008\/CS-TR-2008-002.pdf"},{"key":"474_CR24","doi-asserted-by":"crossref","unstructured":"Whaley RC, Dongarra JJ (1997) Automatically tuned linear algebra software. Technical report, http:\/\/www.netlib.org\/utk\/projects\/atlas\/","DOI":"10.1109\/SC.1998.10004"},{"key":"474_CR25","unstructured":"Whaley CR, Soendergaard P (2008) A collaborative guide to ATLAS development. Available at http:\/\/www.sfr-fresh.com\/unix\/misc\/atlas3.9.24.tar.gz:a\/ATLAS\/doc\/atlas_devel.pdf"},{"key":"474_CR26","unstructured":"Whaley CR, Petitet A, Dongarra JJ (2007) Automated empirical optimization of software and the ATLAS project. Available at http:\/\/www.sfr-fresh.com\/unix\/misc\/atlas3.9.24.tar.gz:a\/ATLAS\/doc\/atlas_over.pdf"},{"key":"474_CR27","doi-asserted-by":"crossref","unstructured":"Xiong J, Johnson J, Johnson R, Padua D (2001) SPL: A Language and a compiler for DSP algorithms. In: Proc of the int conf program lang des implement, pp 298\u2013308","DOI":"10.1145\/378795.378860"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0474-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-010-0474-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0474-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T18:53:49Z","timestamp":1559588029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-010-0474-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s11227-010-0474-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,7]]}}}