Optimal task scheduling of a complete k-ary tree with communication delays

被引：0
|
作者：
Fujimoto, N [1 ]
Hagihara, K [1 ]
机构：
[1] Osaka Univ, Grad Sch Engn Sci, Toyonaka, Osaka 5608531, Japan
来源：
PARALLEL PROCESSING APPLIED MATHEMATICS | 2002年 / 2328卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is known that task scheduling problem of a complete kappa-ary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (kappa - 1) to kappa unit times. We also show that naive scheduling is optimal if communication delays are constant and at most (kappa - 1) unit times.
引用
收藏
页码：71 / 78
页数：8
相关论文
共 50 条
  • [41] Communication algorithms in k-ary n-cube interconnection networks
    Ashir, Y
    Stewart, IA
    Ahmed, A
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 43 - 48
  • [42] K-ary clustering with optimal leaf ordering for gene expression data
    Bar-Joseph, Z
    Demaine, ED
    Gifford, DK
    Hamel, AM
    Jaakkola, TS
    Srebro, N
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2002, 2452 : 506 - 520
  • [43] K-ary clustering with optimal leaf ordering for gene expression data
    Bar-Joseph, Z
    Demaine, ED
    Gifford, DK
    Srebro, N
    Hamel, AM
    Jaakkola, TS
    BIOINFORMATICS, 2003, 19 (09) : 1070 - 1078
  • [44] A New K-Ary Crisp Decision Tree Induction with Continuous Valued Attributes
    SONG Yan
    YAO Shuang
    YU Donghua
    SHEN Yan
    HU Yuzhen
    ChineseJournalofElectronics, 2017, 26 (05) : 999 - 1007
  • [45] Weighted Inequalities for Fractional Maximal Functions on the Infinite Rooted k-Ary Tree
    Ghosh, Abhishek
    Rela, Ezequiel
    JOURNAL OF GEOMETRIC ANALYSIS, 2023, 33 (01)
  • [46] A New K-Ary Crisp Decision Tree Induction with Continuous Valued Attributes
    Song Yan
    Yao Shuang
    Yu Donghua
    Shen Yan
    Hu Yuzhen
    CHINESE JOURNAL OF ELECTRONICS, 2017, 26 (05) : 999 - 1007
  • [47] Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
    Touzene, A
    JOURNAL OF SYSTEMS ARCHITECTURE, 2004, 50 (04) : 221 - 231
  • [48] Weighted Inequalities for Fractional Maximal Functions on the Infinite Rooted k-Ary Tree
    Abhishek Ghosh
    Ezequiel Rela
    The Journal of Geometric Analysis, 2023, 33
  • [49] A randomized algorithm for dynamic tree growing on k-ary n-cubes
    Li, KQ
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 600 - 609
  • [50] Two-stage fault-tolerant k-ary tree multiprocessors
    Izadi, BA
    Özgüner, F
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 527 - 533
12345