A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for scheduling task graphs with communication delays onto multiprocessors |
scientific article |
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
