𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chapter 4: General parallel program scheduling

✍ Scribed by Håkan Lennerstad; Lars Lundberg


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
892 KB
Volume
14
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Approximation algorithms for general par
✍ 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