TREE SCHEDULING WITH COMMUNICATION DELAYS

被引：8
|
作者：
CHRETIENNE, P
机构：
来源：
DISCRETE APPLIED MATHEMATICS | 1994年 / 49卷 / 1-3期
关键词：
D O I：
10.1016/0166-218X(94)90205-4
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper considers the problem of scheduling a tree-structured task system in a distributed environment with the goal of minimizing the makespan. Interprocessor communication delays are taken into account and task duplication is allowed. Furthermore, it is assumed that the number of processors is unlimited. It is shown that there is a polynomial-time algorithm for an outtree and that the intree case is NP-hard. In addition, a special case of intree is shown to be polynomially solvable.
引用
收藏
页码：129 / 141
页数：13
相关论文
共 50 条
  • [1] 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
  • [2] Sensitivity analysis of tree scheduling on two machines with communication delays
    Guinand, F
    Moukrim, A
    Sanlaville, E
    PARALLEL COMPUTING, 2004, 30 (01) : 103 - 120
  • [3] Minimizing the volume in scheduling an out-tree with communication delays and duplication
    Hanen, C
    Kordon, AM
    PARALLEL COMPUTING, 2002, 28 (11) : 1573 - 1585
  • [4] Optimal task scheduling of a complete k-ary tree with communication delays
    Fujimoto, N
    Hagihara, K
    PARALLEL PROCESSING APPLIED MATHEMATICS, 2002, 2328 : 71 - 78
  • [5] MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
    VELTMAN, B
    LAGEWEG, BJ
    LENSTRA, JK
    PARALLEL COMPUTING, 1990, 16 (2-3) : 173 - 182
  • [6] On the complexity of scheduling with large communication delays
    Bampis, E
    Giannakos, A
    Konig, JC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 252 - 260
  • [7] A heuristic for a scheduling problem with communication delays
    Munier, A
    Konig, JC
    OPERATIONS RESEARCH, 1997, 45 (01) : 145 - 147
  • [8] SCHEDULING ROOTED FORESTS WITH COMMUNICATION DELAYS
    ISAAK, G
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1994, 11 (04): : 309 - 316
  • [9] The complexity of scheduling trees with communication delays
    Lenstra, JK
    Veldhorst, M
    Veltman, B
    JOURNAL OF ALGORITHMS, 1996, 20 (01) : 157 - 173
  • [10] MULTIPROCESSOR SCHEDULING WITH INTERPROCESSOR COMMUNICATION DELAYS
    LEE, CY
    HWANG, JJ
    CHOW, YC
    ANGER, FD
    OPERATIONS RESEARCH LETTERS, 1988, 7 (03) : 141 - 147
12345