A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic for scheduling task graphs with communication delays onto multiprocessors |
scientific article; zbMATH DE number 983857
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for scheduling task graphs with communication delays onto multiprocessors |
scientific article; zbMATH DE number 983857 |
Statements
A heuristic for scheduling task graphs with communication delays onto multiprocessors (English)
0 references
27 February 1997
0 references
Multiprocessor scheduling
0 references
Task graph
0 references
Interprocessor communication
0 references
Chaining
0 references
List scheduling
0 references
Parallel processing
0 references
