COMPUTATION TIME AND IDLE TIME OF TILING TRANSFORMATION ON A NETWORK OF WORKSTATIONS

DOI10.1142/S0129053300000126MaRDI QIDQ4550159zbMATHFDO

Authors Shailesh R. Sathe, P. M. Nawghare

Publication date 4 March 2003

Published in International Journal of High Speed Computing (Search for Journal in Brave)

zbMATH Keywords

tilingidle timenetwork of workstations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1520614
• The relation between diamond tiling and hexagonal tiling
• Optimal orthogonal tiling of 2-D iterations
• A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
• Time-minimal and processor-time-minimal loop tiling

Cited in

(2)

• A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
• scientific article; zbMATH DE number 1520614 (Why is no real title available?)

This page was built for publication: COMPUTATION TIME AND IDLE TIME OF TILING TRANSFORMATION ON A NETWORK OF WORKSTATIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550159)