Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401)
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: Minimizing the schedule length for a parallel 3D-grid precedence graph |
scientific article; zbMATH DE number 1252956
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the schedule length for a parallel 3D-grid precedence graph |
scientific article; zbMATH DE number 1252956 |
Statements
Minimizing the schedule length for a parallel 3D-grid precedence graph (English)
0 references
22 February 1999
0 references
precedence graph
0 references
grid
0 references
scheduling
0 references
communications
0 references
overhead
0 references
