A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-8191(96)00041-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081283714 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:54, 30 July 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
