Complexity of Task Graph Scheduling with Fixed Communication Capacity (Q4341041): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1142/s0129054197000045 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126365117 / rank | |||
Normal rank | |||
Latest revision as of 11:03, 30 July 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
