{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:32:50Z","timestamp":1725535970673},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030949"},{"type":"electronic","value":"9783642030956"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03095-6_51","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T17:40:55Z","timestamp":1248975655000},"page":"535-544","source":"Crossref","is-referenced-by-count":1,"title":["A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Ming-Chang","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","unstructured":"Aho, A.V., Hoperoft, J.E., Ullman, J.D.: The design and analysis of computer algorithms, vol.\u00a019. Addison Wesley, Reading"},{"key":"51_CR2","volume-title":"The design and analysis of parallel algorithms","author":"S.S. Aki","year":"1989","unstructured":"Aki, S.S.: The design and analysis of parallel algorithms. Prentice Hall, Englewood Cliffs (1989)"},{"key":"51_CR3","unstructured":"Begulein, A.: Dongarra, j.j., Geist, G.A., Mancheck, P.R., Sunderam, V.S.: PVM user guide and reference manual, Technical report ORNL\/TM-12187, Oak Ridge National Laboratory (1993)"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0167-8191(89)90091-4","volume":"12","author":"J. Berntsen","year":"1989","unstructured":"Berntsen, J.: Communication efficient matrix multiplication on hypercubles. Parallel computing\u00a012, 335\u2013342 (1989)","journal-title":"Parallel computing"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/10637199408962530","volume":"3","author":"Y.P. Boggle","year":"1994","unstructured":"Boggle, Y.P.: Entropy of algorithms and potential parallelism. Parallel algorithms and applications\u00a03, 109\u2013133 (1994)","journal-title":"Parallel algorithms and applications"},{"issue":"3","key":"51_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/B:REOM.0000032111.16328.b2","volume":"10","author":"M. Ceberio","year":"2004","unstructured":"Ceberio, M., Kreinovich, V.: Fast multiplication of interval matrices (Interval version of Strassen\u2019s algorithm). Reliable Computing\u00a010(3), 241\u2013243 (2004)","journal-title":"Reliable Computing"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D. Coppersmith","year":"1973","unstructured":"Coppersmith, D., Winograd, S.: On the asymptotic complexity of matrix multiplication. SIAM journal of computing\u00a011, 472\u2013492 (1973)","journal-title":"SIAM journal of computing"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E. Dekel","year":"1981","unstructured":"Dekel, E., Nassimi, D., Sank, S.: Parallel matrix and graph algorithms. SIAM journal of computing\u00a010, 657\u2013673 (1981)","journal-title":"SIAM journal of computing"},{"key":"51_CR9","first-page":"771","volume":"16","author":"F. Desprez","year":"2004","unstructured":"Desprez, F., Suter, F.: Impact of mixed-parallelism on parallel implementations of the sreassen and winograd matrix multiplication algorithms concurrency. Computing: Practice Experience\u00a016, 771\u2013797 (2004)","journal-title":"Computing: Practice Experience"},{"key":"51_CR10","unstructured":"Dumas, J.G., Pernet, C., Zhou, W.: Memory efficient scheduling of Strassen-Winograd\u2019s matrix multiplication, ACM Transaction on Mathematical Software Tech. Report Arxiv:0707.2347 (2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0707.2347"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10637199408915454","volume":"4","author":"B. Dumitrescu","year":"1994","unstructured":"Dumitrescu, B., Roch, J.L., Trystran, D.: Fast matrix multiplication algorithms on MIMD architectures. Parallel algorithms and applications\u00a04, 53\u201370 (1994)","journal-title":"Parallel algorithms and applications"},{"issue":"1","key":"51_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1016676318988","volume":"37","author":"L.D. Elfimova","year":"2001","unstructured":"Elfimova, L.D., Kapitonova, Y.V.: A fast algorithm for matrix multiplication and its efficient realization on systolic Arrays. Cybernetics and Systems Analysis\u00a037(1), 109\u2013121 (2001)","journal-title":"Cybernetics and Systems Analysis"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-8191(87)90060-3","volume":"4","author":"C.C. Fox","year":"1987","unstructured":"Fox, C.C., Otto, S.W., Heg, A.J.G.: Matrix algorithms on a hypercube I: Matrix multiplication. Parallel computing\u00a04, 17\u201331 (1987)","journal-title":"Parallel computing"},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/10637199508915488","volume":"5","author":"E. Francomano","year":"1995","unstructured":"Francomano, E., Macaluo, A.T.: A recurrence _ free variant of Strassen\u2019s algorithm on hypercube. Parallel algorithms and applications\u00a05, 241\u2013259 (1995)","journal-title":"Parallel algorithms and applications"},{"key":"51_CR15","unstructured":"Francomano, E., Pecorella, A., Macaluso, A.T.: Use of the matrices products in the inverse matrix computation. Parallel computing, 173\u2013181 (1992)"},{"key":"51_CR16","first-page":"142","volume":"73","author":"A.Q. Gates","year":"2001","unstructured":"Gates, A.Q., Kreinovich, V.: Strassen\u2019s algorithm made (somewhat) more natural; a pedagogical remark. European Association for Theoretical Computer Sciences\u00a073, 142\u2013145 (2001)","journal-title":"European Association for Theoretical Computer Sciences"},{"issue":"4","key":"51_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/cpe.4330040403","volume":"4","author":"G.A. Gesit","year":"1992","unstructured":"Gesit, G.A., Sunderman, V.S.: Network based concurrent computing on the PVM system. Journal of concurrence: Practice and experience\u00a04(4), 293\u2013311 (1992)","journal-title":"Journal of concurrence: Practice and experience"},{"key":"51_CR18","unstructured":"Huang, C.H., Johnson, R.W.: Generalizing parallel programs from tensor product formulas: A case study of Strassen\u2019s matrix multiplication algorithm. In: International conference on parallel processing (1992)"},{"issue":"4","key":"51_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0898-1221(95)00216-2","volume":"31","author":"M. Paprzycki","year":"1996","unstructured":"Paprzycki, M., Cyphers, C.: Using Streassen\u2019s matrix multiplication in high performance solution of linear systems. Computer mathematical application\u00a031(4), 55\u201361 (1996)","journal-title":"Computer mathematical application"},{"key":"51_CR20","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Sreassen","year":"1969","unstructured":"Sreassen, V.: Gaussian elimination is not optimal. Numerical mathematics\u00a013, 354\u2013356 (1969)","journal-title":"Numerical mathematics"},{"issue":"4","key":"51_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/cpe.4330020404","volume":"2","author":"v.s. Sunderman","year":"1990","unstructured":"Sunderman, v.s.: PVM: A framework for parallel distributed computing. Journal of concurrence: practice and experience\u00a02(4), 315\u2013339 (1990)","journal-title":"Journal of concurrence: practice and experience"},{"key":"51_CR22","unstructured":"Yu, G.J., Wu, C.C., Lai, C.K.: A Bluetooth-based wireless and parallel computation environment for matrix multiplication. In: Proceeding of eleventh international conference on distributed multimedia system, Bonff, Canada, pp. 387\u2013392 (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03095-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T13:03:39Z","timestamp":1548421419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03095-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030949","9783642030956"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03095-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}