𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiprocessor scheduling algorithm with communication time

✍ Scribed by Hideo Kitagawa; Fumio Matsuda; Yoshiki Uchikawa; Shuzo Hattori

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
546 KB
Volume
22
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Optimal Multiprocessor Real-Time Sche
An Optimal Multiprocessor Real-Time Scheduling Algorithm
✍ Ashok Khemka; R.K. Shyamasundar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 170 KB

An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc

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

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