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

Parallelism measures of task graphs for multiprocessors

โœ Scribed by Kamal Kumar Jain; V. Rajaraman

Publisher
Elsevier Science
Year
1994
Weight
682 KB
Volume
40
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Speed of parallel processing for random
Speed of parallel processing for random task graphs
โœ Marco Isopi; Charles M. Newman ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 681 KB

The random graph model of parallel computation introduced by Gelenbe et al. depends on three parameters: n, the number of tasks (vertices); F, the common distribution of T i , . . . , T,, the task processing times, and p = p,, the probability for a given i < j that task i must be completed before ta

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

Optimal parallel processing of random ta
Optimal parallel processing of random task graphs
โœ Zhen Liu; Rhonda Righter ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 180 KB

We consider scheduling of tasks of parallel programs on multiprocessor systems where tasks have precedence relations and synchronization points. The task graph structures are random variables in the sense that successors to a task do not become known until the task is executed. Thus, as is often the