𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Corrections to "Scheduling Parallel Processable Tasks for a Uniprocessor"

✍ Scribed by Ramamoorthy, C.V.; Li, H.F.

Book ID
114606163
Publisher
IEEE
Year
1978
Tongue
English
Weight
190 KB
Volume
C-27
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An accurate parallel genetic algorithm t
An accurate parallel genetic algorithm to schedule tasks on a cluster
✍ Michelle Moore πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 234 KB

Recent breakthroughs in the mathematical estimation of parallel genetic algorithm parameters are applied to the NP-complete problem of scheduling multiple tasks on a cluster of computers connected by a shared bus. Numerous adjustments to the original method of parameter estimation were made in order

Efficient Scheduling of Arbitrary Task G
Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm
✍ Yu-Kwong Kwok; Ishfaq Ahmad πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 492 KB

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio