Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme

被引：39
|
作者：
Jansen, K [1 ]
机构：
[1] Univ Kiel, Inst Informat & Prakt Math, D-24098 Kiel, Germany
来源：
ALGORITHMICA | 2004年 / 39卷 / 01期
关键词：
scheduling; malleable tasks; approximation algorithms;
D O I：
10.1007/s00453-003-1078-6
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted to it. We study the problem of scheduling a set of n independent malleable tasks on an arbitrary number m of parallel processors and propose an asymptotic fully polynomial time approximation scheme. For any fixed epsilon > 0, the algorithm computes a non-preemptive schedule of length at most (1 + epsilon) times the optimum (plus an additive term) and has running time polynomial in n, m and 1/epsilon.
引用
收藏
页码：59 / 81
页数：23
相关论文
共 50 条
  • [31] STRONGLY FULLY POLYNOMIAL TIME APPROXIMATION SCHEME FOR THE WEIGHTED COMPLETION TIME MINIMIZATION PROBLEM ON TWO-PARALLEL CAPACITATED MACHINES
    Kacem, Imed
    Sahnoune, Myriam
    Schmidt, Guenter
    RAIRO-OPERATIONS RESEARCH, 2017, 51 (04) : 1177 - 1188
  • [32] Strongly Fully Polynomial Time Approximation Scheme for the Weighted Completion Time Minimization Problem on Two-Parallel Capacitated Machines
    Kacem, Imed
    Sahnoune, Myriam
    Schmidt, Guenter
    IFAC PAPERSONLINE, 2016, 49 (12): : 425 - 430
  • [33] An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints
    Jansen, Klaus
    Zhang, Hu
    ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (03) : 416 - 434
  • [34] Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
    Elisabeth Günther
    Felix G. König
    Nicole Megow
    Journal of Combinatorial Optimization, 2014, 27 : 164 - 181
  • [35] Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
    Guenther, Elisabeth
    Koenig, Felix G.
    Megow, Nicole
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 164 - 181
  • [36] A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
    Antonios Antoniadis
    Chien-Chung Huang
    Sebastian Ott
    Algorithmica, 2019, 81 : 3725 - 3745
  • [37] Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles
    Grange, Aristide
    Kacem, Imed
    Martin, Sebastien
    Minich, Sarah
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (01) : 1 - 16
  • [38] Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm
    Eremeev A.V.
    Journal of Applied and Industrial Mathematics, 2011, 5 (03) : 322 - 330
  • [39] A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems
    Caskurlu, Bugra
    Williamson, Matthew
    Subramani, K.
    Mkrtchyan, Vahan
    Wojciechowski, Piotr
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018, 2018, 10743 : 45 - 58
  • [40] A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling
    Deng, XT
    Feng, HD
    Zhang, PX
    Zhu, H
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 26 - 35
12345