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 条
  • [31] A Model of Forming a Simple Path in a Level of a Complete K-ary Tree Maximizing Total Shortening Path Length
    Sawada, Kiyoshi
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 2028 - 2031
  • [32] K-ary search tree revisited: improving construction and intersection efficiency
    SONG Xingshen
    DENG Jinsheng
    QIAO Fengcai
    JIANG Kun
    Frontiers of Computer Science, 2022, 16 (03)
  • [33] Managing Tasks in Confidence Based Learning Using K-ary Tree
    Chatterjee, Rajeev
    Kar, Sadhu Prasad
    Mandal, Jyotsna Kumar
    IMPACT OF THE 4TH INDUSTRIAL REVOLUTION ON ENGINEERING EDUCATION, ICL2019, VOL 2, 2020, 1135 : 12 - 20
  • [34] K-ary search tree revisited: improving construction and intersection efficiency
    Xingshen Song
    Jinsheng Deng
    Fengcai Qiao
    Kun Jiang
    Frontiers of Computer Science, 2022, 16
  • [35] K-ary search tree revisited: improving construction and intersection efficiency
    Song, Xingshen
    Deng, Jinsheng
    Qiao, Fengcai
    Jiang, Kun
    FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (03)
  • [36] SECURE DOMINATION PARAMETERS OF HALIN GRAPH WITH PERFECT K-ARY TREE
    Arasu, R.
    Parvathi, N.
    JOURNAL OF APPLIED MATHEMATICS & INFORMATICS, 2023, 41 (04): : 839 - 848
  • [37] Toward Self-Adjusting k-Ary Search Tree Networks
    Feder, Evgeniy
    Paramonov, Anton
    Mavrin, Pavel
    Salem, Iosif
    Schmid, Stefan
    Aksenov, Vitaly
    2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024, 2024, : 1209 - 1211
  • [38] Switch Fault Tolerance in a Mirrored K-Ary N-Tree
    Li, Yamin
    Chu, Wanming
    PROCEEDING OF THE 2019 INTERNATIONAL CONFERENCE ON COMPUTER, INFORMATION AND TELECOMMUNICATION SYSTEMS (IEEE CITS 2019), 2019, : 25 - 29
  • [39] The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k-Ary Tree
    Stanic, Zoran
    ALGEBRA COLLOQUIUM, 2025, 32 (01) : 53 - 58
  • [40] Adding edges between one node and every other node with the same depth in a complete K-ary tree
    Sawada, Kiyoshi
    Mitsuishi, Takashi
    World Academy of Science, Engineering and Technology, 2009, 38 : 702 - 704
12345