𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

✍ Scribed by Liya Fan; Fa Zhang; Gongming Wang; Zhiyong Liu

Book ID
113743701
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
531 KB
Volume
72
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for general par
Approximation algorithms for general parallel task scheduling
✍ Oh-Heum Kwon; Kyung-Yong Chwa πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot

An efficient parallel algorithm for sche
An efficient parallel algorithm for scheduling interval ordered tasks
✍ Yoojin Chung; Kunsoo Park πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 187 KB

We present an efficient parallel algorithm for scheduling n unit length tasks on m identical processors when the precedence graphs are interval orders. Our algorithm requires Oðlog 2 v þ ðn log nÞ=vÞ time and Oðnv 2 þ n 2 Þ operations on the CREW PRAM, where v can be any number between 1 and n: By c

An approximation result for a duo-proces
An approximation result for a duo-processor task scheduling problem
✍ P. Dell'Olmo; S. Giordani; M.G. Speranza πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 479 KB

We consider the problem of scheduling tasks on a set of dedicated processors, where each task requires a subset of two processors be simultaneously available for a given processing time. The objective is to determine a nonpreemptive schedule with minimum completion time. By means of a graph theoreti