𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List scheduling of parallel tasks

✍ Scribed by Qingzhou Wang; Kam Hoi Cheng

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
940 KB
Volume
37
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling Interval Ordered Tasks in Par
Scheduling Interval Ordered Tasks in Parallel
✍ Sivaprakasam Sunder; Xin He πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 148 KB

We present the first NC algorithm for scheduling n unit length tasks on m identical processors for the case where the precedence constraint is an interval order. Our algorithm runs on a priority concurrent read, concurrent write parallel Ε½ 2 . Ε½ 5 . Ε½ 3 . random access machine in O log n with O n pr

Models and Scheduling Algorithms for Mix
Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs
✍ Soumen Chakrabarti; James Demmel; Katherine Yelick πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 400 KB

An increasing number of scientific programs exhibit two forms of parallelism, often in a nested fashion. At the outer level, the application comprises coarse-grained task parallelism, with dependencies between tasks reflected by an acyclic graph. At the inner level, each node of the graph is a data-

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