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 条
  • [21] Optimal algorithm for tree scheduling with unit time communication delays
    Wajdi, T
    Imtiaz, A
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2001, 148 (02): : 79 - 88
  • [22] Flexible routing in a distributed K-ary tree: the K-Umbrella
    Sotiriou, Athanasios-Dimitrios
    Kalliaras, Panagiotis
    Mitrou, Nikolas
    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2009, 20 (02): : 139 - 157
  • [23] TREE SCHEDULING WITH COMMUNICATION DELAYS
    CHRETIENNE, P
    DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 129 - 141
  • [24] Embedding of k-ary complete trees into hypercubes with uniform load
    Trdlicka, J
    Tvrdik, P
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 52 (02) : 120 - 131
  • [25] Reconfiguration in a circuit-switched k-ary tree multiprocessor
    Izadi, BA
    Özgüner, F
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1658 - 1667
  • [26] Certificate revocation protocol using k-ary hash tree
    Kikuchi, H
    Abe, K
    Nakanishi, S
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2001, E84B (08) : 2026 - 2032
  • [27] Weighted Lp estimates on the infinite rooted k-ary tree
    Ombrosi, Sheldy
    Rivera-Rios, Israel P.
    MATHEMATISCHE ANNALEN, 2022, 384 (1-2) : 491 - 510
  • [28] Constructing k-ary orientable sequences with asymptotically optimal length
    Gabric, Daniel
    Sawada, Joe
    DESIGNS CODES AND CRYPTOGRAPHY, 2025,
  • [29] ILP Formulations for Optimal Task Scheduling with Communication Delays on Parallel Systems
    Venugopalan, Sarad
    Sinnen, Oliver
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (01) : 142 - 151
  • [30] Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion
    Trdlicka, J
    Tvrdíik, P
    PARALLEL COMPUTING, 2000, 26 (06) : 783 - 790
12345