{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:11Z","timestamp":1725514991656},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540794080"},{"type":"electronic","value":"9783540794097"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79409-7_31","type":"book-chapter","created":{"date-parts":[[2008,6,18]],"date-time":"2008-06-18T03:09:47Z","timestamp":1213758587000},"page":"445-457","source":"Crossref","is-referenced-by-count":0,"title":["A New Direction to Parallelize Winograd\u2019s Algorithm on Distributed Memory Computers"],"prefix":"10.1007","author":[{"given":"D. K.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Lavallee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1_1","unstructured":"L. E. Cannon. A cellular computer to implement the kalman filter algorithm. Ph.d. thesis, Montana State University, 1969."},{"key":"31_CR2_1","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/IPPS.1997.580916","volume-title":"11th International Parallel Processing Symposium","author":"J Choi","year":"1997","unstructured":"J. Choi. A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers. In 11th International Parallel Processing Symposium, pages 310\u2013317, Geneva, Switzerland, April 1997. IEEE CS."},{"issue":"7","key":"31_CR3_1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/cpe.4330060702","volume":"6","author":"J Choi","year":"1994","unstructured":"J. Choi, J. J. Dongarra, and D. W. Walker. Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience, 6(7):543\u2013570, 1994.","journal-title":"Concurrency: Practice and Experience"},{"issue":"2","key":"31_CR4_1","first-page":"4","volume":"30","author":"C-C Chou","year":"1995","unstructured":"C.-C. Chou, Y. Deng, G. Li, and Y. Wang. Parallelizing strassen\u2019s method for matrix multiplication on distributed memory mimd architectures. Computers and Math. with Applications, 30(2):4\u20139, 1995.","journal-title":"Computers and Math. with Applications"},{"issue":"3","key":"31_CR5_1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251\u2013280, 1990.","journal-title":"Journal of Symbolic Computation"},{"key":"31_CR6_1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-8191(87)90060-3","volume":"4","author":"G Fox","year":"1987","unstructured":"G. Fox, S. Otto, and A. Hey. Matrix algorithms on a hypercube i: Matrix multiplication. Parallel Computing, 4:17\u201331, 1987.","journal-title":"Parallel Computing"},{"key":"31_CR7_1","unstructured":"G. H. Golub and C. F. V. Loan. Matrix Computations. Johns Hopkins University Press, 2nd edition, 1989."},{"issue":"1","key":"31_CR8_1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626496000029","volume":"6","author":"B Grayson","year":"1996","unstructured":"B. Grayson, A. Shah, and R. van de Geijn. A high performance parallel Strassen implementation. Parallel Processing Letters, 6(1):3\u201312, 1996.","journal-title":"Parallel Processing Letters"},{"issue":"7","key":"31_CR9_1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1002\/cpe.4330060703","volume":"6","author":"S Huss-Lederman","year":"1994","unstructured":"S. Huss-Lederman, E. M. Jacobson, A. Tsao, and G. Zhang. Matrix multiplication on the intel touchstone delta. Concurrency: Practice and Experience, 6(7):571\u2013594, 1994.","journal-title":"Concurrency: Practice and Experience"},{"issue":"3","key":"31_CR10_1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0893-9659(90)90139-3","volume":"3","author":"B Kumar","year":"1990","unstructured":"B. Kumar, C.-H. Huang, R. W. Johnson, and P. Sadayappan. A tensor product formulation of Strassen\u2019s matrix multiplication algorithm. Applied Mathematics Letters, 3(3):67\u201371, 1990.","journal-title":"Applied Mathematics Letters"},{"key":"31_CR11_1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0024-3795(92)90393-O","volume":"162","author":"J Laderman","year":"1992","unstructured":"J. Laderman, V. Y. Pan, and H. X. Sha. On practical algorithms for accelerated matrix multiplication. Linear Adgebra and Its Applications, 162:557\u2013588, 1992.","journal-title":"Linear Adgebra and Its Applications"},{"key":"31_CR12_1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/315891.315965","volume-title":"Proceedings of the 1995 ACM symposium on Applied computing","author":"Q Luo","year":"1995","unstructured":"Q. Luo and J. B. Drake. A scalable parallel Strassen\u2019s matrix multiplication algorithm for distributed memory computers. In Proceedings of the 1995 ACM symposium on Applied computing, pages 221 \u2013 226, Nashville, Tennessee, United States, 1995. ACM Press."},{"issue":"3","key":"31_CR13_1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/1026076","volume":"26","author":"VY Pan","year":"1984","unstructured":"V. Y. Pan. How can we speed up matrix multiplication? SIAM Review, 26(3):393\u2013416, 1984.","journal-title":"SIAM Review"},{"key":"31_CR14_1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"V. Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354\u2013356, 1969.","journal-title":"Numer. Math."},{"issue":"4","key":"31_CR15_1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"R Geijn van de","year":"1997","unstructured":"R. van de Geijn and J. Watts. Summa: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience, 9(4):255\u2013274, April 1997.","journal-title":"Concurrency: Practice and Experience"},{"key":"31_CR16_1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"S. Winograd. On multiplication of 2 x 2 matrices. Linear Algebra and its Applications, 4:381\u2013388, 1971.","journal-title":"Linear Algebra and its Applications"}],"container-title":["Modeling, Simulation and Optimization of Complex Processes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79409-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:02Z","timestamp":1619508062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79409-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540794080","9783540794097"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79409-7_31","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}