Tree-Based Parallel Algorithm Design

被引：0
|
作者：
G. L. Miller
S. -H. Teng
机构：
[1] School of Computer Science,
[2] Carnegie Mellon University,undefined
[3] Pittsburgh,undefined
[4] PA 15213,undefined
[5] USA. glmiller@cs.cmu.edu. ,undefined
[6] Department of Computer Science,undefined
[7] University of Minnesota,undefined
[8] Minneapolis,undefined
[9] MN 55455,undefined
[10] USA. steng@cs.umn.edu. ,undefined
来源：
Algorithmica | 1997年 / 19卷
关键词：
Key words. Parallel tree contraction, Parallel algorithms, Algebraic computing, Code optimization, List ranking, Parallel prefix sum.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper a systematic method for the design of efficient parallel algorithms for the dynamic evaluation of computation trees and/or expressions is presented. This method involves the use of uniform closure properties of certain classes of unary functions. Using this method, optimal parallel algorithms are given for many computation tree problems which are important in parallel algebraic and numerical computation, and parallel code generation on exclusive read and exclusive write parallel random access machines. Our algorithmic result is complemented by a P-complete tree problem.
引用
收藏
页码：369 / 389
页数：20
相关论文
共 50 条
  • [31] The effect of varying computational granularity and tree imbalance on the performance of parallel tree-based application
    Haron, F
    Davy, JR
    [J]. PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2004, 3320 : 230 - 233
  • [32] A fast tree-based algorithm for Compressed Sensing with sparse-tree prior
    Bui, H. Q.
    La, C. N. H.
    Da, M. N.
    [J]. SIGNAL PROCESSING, 2015, 108 : 628 - 641
  • [33] Design and implementation of the tree-based fuzzy logic controller
    Liu, BD
    Huang, CY
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1997, 27 (03): : 475 - 487
  • [34] SMOTER, A Structured Motif Finder Based on an Exhaustive Tree-Based Algorithm
    Sheikhizadeh, Siavash
    Hosseini, Samin
    [J]. CURRENT BIOINFORMATICS, 2014, 9 (01) : 34 - 43
  • [35] Tree-based classification and regression Part 3: Tree-based procedures
    Gunter, B
    [J]. QUALITY PROGRESS, 1998, 31 (02) : 121 - 123
  • [36] A congestion control algorithm for tree-based reliable multicast protocols
    Chiu, DM
    Kadansky, M
    Provino, J
    Wesley, J
    Bischof, HP
    Zhu, HF
    [J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1209 - 1217
  • [37] Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
    Clemencon, Stephan
    Vayatis, Nicolas
    [J]. ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2008, 5254 : 22 - +
  • [38] Tree-based differential evolution algorithm for QoS multicast routing
    KONG Sun
    [J]. The Journal of China Universities of Posts and Telecommunications, 2011, 18 (04) : 76 - 81
  • [39] Genetic algorithm and decision tree-based oscillatory stability assessment
    Teeuwsen, SP
    Erlich, I
    El-Sharkawi, MA
    Bachmann, U
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (02) : 746 - 753
  • [40] Tree-Based Genetic Algorithm with Binary Encoding for QoS Routing
    Maniscalco, Vincenzo
    Polito, Silvana Greco
    Intagliata, Antonio
    [J]. 2013 SEVENTH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS 2013), 2013, : 101 - 107
12345