๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A comparison of multiprocessor task scheduling algorithms with communication costs

โœ Scribed by Reakook Hwang; Mitsuo Gen; Hiroshi Katayama

Book ID
108105777
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
292 KB
Volume
35
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A standard task graph set for fair evalu
A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
โœ Takao Tobita; Hironori Kasahara ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 587 KB

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it di cult to compare the performance of algorithms developed in di erent res

A comparison of heuristics for schedulin
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
โœ A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know

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

Project scheduling with multiple modes:
Project scheduling with multiple modes: A comparison of exact algorithms
โœ Hartmann, S๏ฟฝnke; Drexl, Andreas ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 1 views

This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature, we