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 条
  • [1] BANDWIDTH OF THE COMPLETE K-ARY TREE
    SMITHLINE, L
    DISCRETE MATHEMATICS, 1995, 142 (1-3) : 203 - 212
  • [2] An Optimal Level of Adding Edges for a Simple Path to a Complete K-ary Tree
    Sawada, Kiyoshi
    IAENG TRANSACTIONS ON ENGINEERING TECHNOLOGIES, VOL 5, 2010, 1285 : 158 - 164
  • [3] Percolation on a k-ary tree
    Kobayashi, K.
    Morita, H.
    Hoshi, M.
    General Theory of Information Transfer and Combinatorics, 2006, 4123 : 633 - 638
  • [4] An Optimal Placement of a Liaison between Two Levels in an Organization Structure of a Complete K-ary Tree
    Sawada, Kiyoshi
    Kawakatsu, Hidefumi
    ENGINEERING LETTERS, 2011, 19 (03) : 235 - 239
  • [5] Embedding of k-ary complete trees into hypercubes with optimal load
    Trdlicka, J
    Tvrdik, P
    EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 600 - 607
  • [6] Models of adding relations to an organization structure of a complete K-ary tree
    Sawada, Kiyoshi
    Wilson, Richard
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (03) : 1491 - 1500
  • [7] Antibandwidth of complete k-ary trees
    Calamoneri, Tiziana
    Massini, Annalisa
    Toeroek, L'ubomir
    Vrt'o, Imrich
    DISCRETE MATHEMATICS, 2009, 309 (22) : 6408 - 6414
  • [8] Reconfigurable k-ary tree multiprocessors
    Izadi, B.A.
    Ozguner, F.
    International Journal of Parallel and Distributed Systems and Networks, 2000, 3 (04): : 227 - 234
  • [9] An Optimal Placement of a Liaison with Short Communication Lengths Between Two Members of the Same Level in an Organization Structure of a Complete K-ary Tree
    Sawada, Kiyoshi
    OPERATIONS RESEARCH PROCEEDINGS 2013, 2014, : 389 - 395
  • [10] Antimagic orientations for the complete k-ary trees
    Song, Chen
    Hao, Rong-Xia
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (04) : 1077 - 1085
12345