A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
From MaRDI portal
Publication:1877637
DOI10.1016/S0743-7315(03)00102-3zbMath1121.68344OpenAlexW2063400505MaRDI QIDQ1877637
A. Sotiropoulos, G. Goumas, Nectarios Koziris
Publication date: 19 August 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00102-3
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Related Items (1)
This page was built for publication: A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
