A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication

被引:0
|
作者
Lee, Ming-Chang [1 ]
机构
[1] Fooyin Univ, Dept Informat Management, Kaohsiung, Taiwan
关键词
Matrix multiplication; Strassen's algorithm; Winograd's algorithm; PVM; speedup; efficiency; ALGORITHMS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd's algorithm and analyzes empirical Study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cluster), which is not supercomputer. Firstly, we represent standard, strassen and winograd algorithm for matrix-matrix Multiplication. Secondly, we develop a parallel implementation with master-slave processor. Thirdly, the efficiency of the proposed implementations is evaluated by using PVM.
引用
收藏
页码:535 / 544
页数:10
相关论文
共 50 条
  • [1] An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication
    Eagan, John
    Herdman, Marc
    Vaughn, Christian
    Bean, Nathaniel
    Kern, Sarah
    Pirouz, Matin
    2023 IEEE 13TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE, CCWC, 2023, : 442 - 449
  • [2] DIVIDE-AND-CONQUER
    JEFFRIES, T
    BYTE, 1993, 18 (03): : 187 - &
  • [3] DIVIDE-AND-CONQUER
    SAWYER, P
    CHEMICAL ENGINEER-LONDON, 1990, (484): : 36 - 38
  • [4] DIVIDE-AND-CONQUER
    WRIGHT, DP
    SCOFIELD, CL
    BYTE, 1991, 16 (04): : 207 - 210
  • [5] DIVIDE-AND-CONQUER
    GEORGHIOU, C
    FIBONACCI QUARTERLY, 1992, 30 (03): : 284 - 285
  • [6] DIVIDE-AND-CONQUER
    LEWIS, R
    CHEMISTRY IN BRITAIN, 1992, 28 (12) : 1092 - 1093
  • [7] A divide-and-conquer algorithm for binary matrix completion
    Beckerleg, Melanie
    Thompson, Andrew
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 601 : 113 - 133
  • [8] A divide-and-conquer strategy for shallow parsing of German
    Neumann, G
    Braun, C
    Piskorski, J
    6TH APPLIED NATURAL LANGUAGE PROCESSING CONFERENCE/1ST MEETING OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE AND PROCEEDINGS OF THE ANLP-NAACL 2000 STUDENT RESEARCH WORKSHOP, 2000, : 239 - 246
  • [9] Permutation coding using divide-and-conquer strategy
    Tu, Kun
    Puchala, Dariusz
    2023 DATA COMPRESSION CONFERENCE, DCC, 2023, : 365 - 365
  • [10] APPLICATIONS OF A STRATEGY FOR DESIGNING DIVIDE-AND-CONQUER ALGORITHMS
    SMITH, DR
    SCIENCE OF COMPUTER PROGRAMMING, 1987, 8 (03) : 213 - 229