𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domination analysis for minimum multiprocessor scheduling

✍ Scribed by Gregory Gutin; Tommy Jensen; Anders Yeo

Book ID
108112583
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
198 KB
Volume
154
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel optimization algorithm for mi
A parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem
✍ Hironori Kasahara; Atsusi Itoh; Hisamitsu Tanaka; Keisuke Itoh πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 944 KB

## Abstract This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution‐time multiprocessor scheduling problem which is a strong NP‐hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS am

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

Scalable scheduling for symmetric multip
Scalable scheduling for symmetric multiprocessors (SMP)
✍ Oh-Han Kang; Dharma P. Agrawal πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 737 KB

We present a task duplication-based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task scheduling. The algorithm pre-allocates network communication resources so as to avoid potential communication conflicts, a