𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact algorithm for scheduling identical coupled tasks

✍ Scribed by Dino Ahr; József Békési; Gábor Galambos; Marcus Oswald; Gerhard Reinelt

Publisher
Springer
Year
2004
Tongue
English
Weight
277 KB
Volume
59
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling algorithm for nonpreemptive m
Scheduling algorithm for nonpreemptive multiprocessor tasks
✍ J.-F. Lin; S.-J. Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 619 KB

This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only "one" processor whenever it is in processing. In our multip

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

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