Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

Authors:
Klaus Jansen
Affiliations:
Institut für Informatik und praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstrasse 40, 24098 Kiel, Germany
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 19

On strip packing With rotations

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems

Parallel Computing - Heterogeneous computing
An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks

Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
An approximation algorithm for scheduling malleable tasks under general precedence constraints

ACM Transactions on Algorithms (TALG)
Data parallel scheduling of operations in linear algebra on heterogeneous clusters

DIWEB'06 Proceedings of the 5th WSEAS International Conference on Distance Learning and Web Engineering
A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters

High Performance Computing for Computational Science - VECPAR 2008
Tightness results for malleable task scheduling algorithms

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Scheduling parallel eigenvalue computations in a quantum chemistry code

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Online malleable job scheduling for m≤3

Information Processing Letters
Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters

Parallel Computing
Scheduling jobs on heterogeneous platforms

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Scheduling malleable tasks with precedence constraints

Journal of Computer and System Sciences
Approximation Algorithms for Scheduling Parallel Jobs

SIAM Journal on Computing
Scheduling parallel jobs with linear speedup

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

Journal of Parallel and Distributed Computing
Efficient multi-way theta-join processing using MapReduce

Proceedings of the VLDB Endowment
A framework for the application of metaheuristics to tasks-to-processors assignation problems

The Journal of Supercomputing
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 ε 0, the algorithm computes a non-preemptive schedule of length at most (1+ε) times the optimum (plus an additive term) and has running time polynomial in n,m and 1 /ε.