Approximation Algorithms for Scheduling Independent Malleable Tasks

Authors:
Jacek Blazewicz;M. Machowiak;Gregory Mounie;Denis Trystram
Affiliations:
-;-;-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 7
Cited 2

Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers
Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
Approximate algorithms scheduling parallelizable tasks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Algorithms for scheduling malleable and nonmalleable parallel tasks

Algorithms for scheduling malleable and nonmalleable parallel tasks
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
Efficient approximation algorithms for scheduling malleable tasks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Linear-time approximation schemes for scheduling malleable parallel tasks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time

Computers and Operations Research
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Malleable tasks consist in considering the tasks of a parallel program as large computational units that may be themselves parallelized. In this paper we investigate the problem of scheduling a set of n independent malleable tasks on a m processors system, starting from the continuous version of the problem.