A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping (Q1877637)
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: A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping |
scientific article; zbMATH DE number 2092814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping |
scientific article; zbMATH DE number 2092814 |
Statements
A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping (English)
0 references
19 August 2004
0 references
