DIVIDE-AND-CONQUER FOR PARALLEL PROCESSING

被引:0
|
作者
HOROWITZ, E [1 ]
ZORAT, A [1 ]
机构
[1] SUNY STONY BROOK,DEPT COMP SCI,STONY BROOK,NY 11794
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
下载
收藏
页码:582 / 585
页数:4
相关论文
共 50 条
  • [11] DIVIDE-AND-CONQUER
    LEWIS, R
    CHEMISTRY IN BRITAIN, 1992, 28 (12) : 1092 - 1093
  • [12] Divide-and-conquer parallel programming with Minimally Synchronous Parallel ML
    Benheddi, Radia
    Loulergue, Frederic
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 1078 - 1085
  • [13] A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
    Martinez, Millan A.
    Fraguela, Basilio B.
    Cabaleiro, Jose C.
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2021, 49 (06) : 820 - 845
  • [14] Modeling and simulation of parallel adaptive divide-and-conquer algorithms
    Barros, Fernando J.
    JOURNAL OF SUPERCOMPUTING, 2008, 43 (03): : 241 - 255
  • [15] Satin: Efficient parallel divide-and-conquer in Java']Java
    van Nieuwpoort, RV
    Kielmann, T
    Bal, HE
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 690 - 699
  • [16] Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood
    Du, Z
    Stamatakis, A
    Lin, F
    Roshan, U
    Nakhleh, L
    HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2005, 3726 : 776 - 785
  • [17] EFFICIENT PARALLEL DIVIDE-AND-CONQUER FOR A CLASS OF INTERCONNECTION TOPOLOGIES
    WU, IC
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 229 - 240
  • [18] A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
    Millán A. Martínez
    Basilio B. Fraguela
    José C. Cabaleiro
    International Journal of Parallel Programming, 2021, 49 : 820 - 845
  • [19] The divide-and-conquer manifesto
    Dietterich, TG
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2000, 1968 : 13 - 26
  • [20] CASCADING DIVIDE-AND-CONQUER - A TECHNIQUE FOR DESIGNING PARALLEL ALGORITHMS
    ATALLAH, MJ
    COLE, R
    GOODRICH, MT
    SIAM JOURNAL ON COMPUTING, 1989, 18 (03) : 499 - 532