Complexity of Task Graph Scheduling with Fixed Communication Capacity (Q4341041): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 15:25, 5 March 2024
scientific article; zbMATH DE number 1023052
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Task Graph Scheduling with Fixed Communication Capacity |
scientific article; zbMATH DE number 1023052 |
Statements
Complexity of Task Graph Scheduling with Fixed Communication Capacity (English)
0 references
16 June 1997
0 references
scheduling problem
0 references
parallel computations
0 references
multiprocessor systems
0 references
