✦ LIBER ✦

Approximation Algorithms for Multiprocessor Scheduling under Uncertainty

✍ Scribed by Guolong Lin; Rajmohan Rajaraman

Publisher: Springer
Year: 2010
Tongue: English
Weight: 538 KB
Volume: 47
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-010-9250-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time approximation algorithm fo

A linear time approximation algorithm for multiprocessor scheduling

✍ Greg Finn; Ellis Horowitz 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 540 KB

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

Approximation Algorithms for Scheduling

Approximation Algorithms for Scheduling with

✍ Florian Diedrich; Klaus Jansen; Fanny Pascual; Denis Trystram 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 474 KB

Algorithms for semi on-line multiprocess

Algorithms for semi on-line multiprocessor scheduling problems

✍ He Yong; Yang Qi-fan; Tan Zhi-yi; Yao En-yu 📂 Article 📅 2002 🏛 SP Zhejiang University Press 🌐 English ⚖ 407 KB

A parallel approximation scheme for the

A parallel approximation scheme for the multiprocessor scheduling problem

✍ Ricardo C. Corrêa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 433 KB

In this paper, a parallel branch-and-bound approach for ®nding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ®nd solutions to the subproblems enumerated during the

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