but the Divide & Conquer method is clearly the fastest in my testing. In: Proceeding of eleventh international conference on distributed multimedia system, Bonff, Canada, pp.From what I understand, Strassen's method for multiplying Matrices should be the fastest. The equation 4. B, with the assumption that n is an exact power of 2 in each of the n x n matrices. Yu, G.J., Wu, C.C., Lai, C.K.: A Bluetooth-based wireless and parallel computation environment for matrix multiplication. The divide-and-conquer algorithm to compute the matrix product C A. ![]() Journal of concurrence: practice and experience 2(4), 315–339 (1990) Sunderman, v.s.: PVM: A framework for parallel distributed computing. Sreassen, V.: Gaussian elimination is not optimal. Paprzycki, M., Cyphers, C.: Using Streassen’s matrix multiplication in high performance solution of linear systems. In: International conference on parallel processing (1992) Step 1: Take three matrices to suppose A, B, C where C is the resultant matrix and A and B are Matrix which is to be multiplied using Strassen’s Method. Huang, C.H., Johnson, R.W.: Generalizing parallel programs from tensor product formulas: A case study of Strassen’s matrix multiplication algorithm. Journal of concurrence: Practice and experience 4(4), 293–311 (1992) Gesit, G.A., Sunderman, V.S.: Network based concurrent computing on the PVM system. European Association for Theoretical Computer Sciences 73, 142–145 (2001) Gates, A.Q., Kreinovich, V.: Strassen’s algorithm made (somewhat) more natural a pedagogical remark. Parallel algorithms and applications 5, 241–259 (1995)įrancomano, E., Pecorella, A., Macaluso, A.T.: Use of the matrices products in the inverse matrix computation. Parallel computing 4, 17–31 (1987)įrancomano, E., Macaluo, A.T.: A recurrence _ free variant of Strassen’s algorithm on hypercube. It was the key, for example, to Karatsuba's fast multiplication method, the quicksort and mergesort algorithms, the Strassen algorithm for matrix multiplication, and fast Fourier transforms. We will provide more insights about this. The divide-and-conquer paradigm often helps in the discovery of efficient algorithms. Cybernetics and Systems Analysis 37(1), 109–121 (2001)įox, C.C., Otto, S.W., Heg, A.J.G.: Matrix algorithms on a hypercube I: Matrix multiplication. The best examples of this are calculating the power function, Karatsuba algorithm, and Strassen matrix multiplication. Parallel algorithms and applications 4, 53–70 (1994)Įlfimova, L.D., Kapitonova, Y.V.: A fast algorithm for matrix multiplication and its efficient realization on systolic Arrays. Report Arxiv:0707.2347 (2007), ĭumitrescu, B., Roch, J.L., Trystran, D.: Fast matrix multiplication algorithms on MIMD architectures. ![]() Strassens algorithm for matrix multiplication reduces the cost from the. Computing: Practice Experience 16, 771–797 (2004)ĭumas, J.G., Pernet, C., Zhou, W.: Memory efficient scheduling of Strassen-Winograd’s matrix multiplication, ACM Transaction on Mathematical Software Tech. In computer science, a divide-and-conquer algorithm works by decomposing. SIAM journal of computing 10, 657–673 (1981)ĭesprez, F., Suter, F.: Impact of mixed-parallelism on parallel implementations of the sreassen and winograd matrix multiplication algorithms concurrency. SIAM journal of computing 11, 472–492 (1973)ĭekel, E., Nassimi, D., Sank, S.: Parallel matrix and graph algorithms. I am having trouble getting divide and conquer matrix multiplication to work. Reliable Computing 10(3), 241–243 (2004)Ĭoppersmith, D., Winograd, S.: On the asymptotic complexity of matrix multiplication. Parallel algorithms and applications 3, 109–133 (1994)Ĭeberio, M., Kreinovich, V.: Fast multiplication of interval matrices (Interval version of Strassen’s algorithm). Parallel computing 12, 335–342 (1989)īoggle, Y.P.: Entropy of algorithms and potential parallelism. Prentice Hall, Englewood Cliffs (1989)īegulein, 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)īerntsen, J.: Communication efficient matrix multiplication on hypercubles. This paper deals with parallels of the fast matrix multiplication strassens algorithm, winograds algorithm and analyzes empirical study of the matrix. Addison Wesley, ReadingĪki, S.S.: The design and analysis of parallel algorithms. Aho, A.V., Hoperoft, J.E., Ullman, J.D.: The design and analysis of computer algorithms, vol. 19.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |