Article

Minimizing Completion Time for Loop Tiling with Computation and Communication Overlapping

Authors:

Georgios I. Goumas,

Aristidis Sotiropoulos,

Nectarios KozirisAuthors Info & Claims

IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium

Page 39

Published: 23 April 2001 Publication History

Abstract

No abstract available.

References

[1]

T. Andronikos, N. Koziris, G. Papakonstantinou, P. Tsanakas, Optimal Scheduling for UET/UET-UCT Generalized N-Dimensional Grid Task Graphs , Journal of Parallel and Distributed Computing, vol. 57, no. 2, pp. 140-165, May 1999.

Crossref

Google Scholar

[2]

P. Boulet, A. Darte, T. Risset, Y. Robert, (Pen)- ultimate tiling? , INTEGRATION, The VLSI Jounal, volume 17, pp. 33-51, 1994.

Crossref

Google Scholar

[3]

I. Drossitis, G. Goumas, N. Koziris, G. Papakonstantinou, P. Tsanakas, Evaluation of Loop Grouping Methods based on Orthogonal Projection Spaces , in Proceedings of the 2000 Int'l Conference on Parallel Processing, pp. 469-476, Toronto, Canada, Aug. 2000.

Crossref

Google Scholar

[4]

E. Hodzic, W. Shang, On Supernode Transformation with Minimized Total Running Time , IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 5, pp. 417-428, May 1998.

Crossref

Google Scholar

[5]

E. H. Hollander, Partitioning and Labeling Loops by Unimodular Transformations , IEEE Trans. on Parallel and Distributed Systems, vol. 3, no. 4, pp. 465-476, Jul. 1992.

Crossref

Google Scholar

[6]

F. Irigoin, R. Triolet, Supernode Partitioning , Proc. 15th Ann. ACM SIGACT-SIGPLAN Symp. Principles of Programming Languages, pp. 319-329, San Diego, California, Jan 1988.

Crossref

Google Scholar

[7]

P. Tsanakas, N. Koziris, G. Papakonstantinou, Chain Grouping: A Method for Partitioning Loops onto Mesh-Connected Processor Arrays , IEEE Trans. on Parallel and Distributed Systems vol. 57, no. 2, pp. 941-955, Sep. 2000.

Crossref

Google Scholar

[8]

J. Ramanujam, P. Sadayappan, Tiling Multidimensional Iteration Spaces for Multicomputers , Journal of Parallel and Distributed Computing, vol. 16, pp.108- 120, 1992.

Google Scholar

[9]

W. Shang, J.A.B. Fortes, Independent Partitioning of Algorithms with Uniform Dependencies , IEEE Trans. Comput., vol. 41, no. 2, pp. 190-206, Feb. 1992.

Crossref

Google Scholar

[10]

W. Shang, J.A.B. Fortes, Time Optimal Linear Schedules for Algorithms with Uniform Dependencies , IEEE Trans. Comput., vol. 40, no. 6, pp. 723-742, June 1991.

Crossref

Google Scholar

[11]

J. Xue, Communication-Minimal Tiling of Uniform Dependence Loops , Journal of Parallel and Distributed Computing, vol. 42, no.1, pp. 42-59, 1997.

Crossref

Google Scholar

[12]

J. Xue, On Tiling as a Loop Transformation , Parallel Processing Letters, vol.7, no.4, pp. 409-424, 1997.

Google Scholar

Cited By

View all

Papadopoulou NGoumas GKoziris N(2017)Predictive communication modeling for HPC applicationsCluster Computing10.1007/s10586-017-0821-820:3(2725-2747)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10586-017-0821-8
Drosinos NGoumas GKoziris N(2006)Selecting the tile shape to reduce the total communication volumeProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899073(144-144)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899073
Ciorba FAndronikos TRiakiotakis IChronopoulos APapakonstantinou G(2006)Dynamic multi phase scheduling for heterogeneous clusteProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899004(72-72)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899004
Show More Cited By

Recommendations

Minimizing Completion Time for Loop Tiling with Computation and Communication Overlapping
IPDPS '01: Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS'01) - Volume 1

This paper proposes a new method for the problem of minimizing the execution time of nested for-loops using a tiling transformation. In our approach, we are interested not only in tile size and shape according to the required communication to ...
A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping

This paper proposes a new method for the problem of minimizing the execution time of nested for-loops using a tiling transformation. In our approach, we are interested not only in tile size and shape according to the required communication to ...
Tiling imperfectly-nested loop nests
SC '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing

Tiling is one of the more important transformations for enhancing loca lity of reference in programs. Intuitively, tiling a set of loops achieves the effect of interleaving iterations of these loops. Tiling of perfectly-nested loop nests (which are loop ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium

April 2001

ISBN:0769509908

Publisher

IEEE Computer Society

United States

Publication History

Published: 23 April 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Papadopoulou NGoumas GKoziris N(2017)Predictive communication modeling for HPC applicationsCluster Computing10.1007/s10586-017-0821-820:3(2725-2747)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10586-017-0821-8
Drosinos NGoumas GKoziris N(2006)Selecting the tile shape to reduce the total communication volumeProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899073(144-144)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899073
Ciorba FAndronikos TRiakiotakis IChronopoulos APapakonstantinou G(2006)Dynamic multi phase scheduling for heterogeneous clusteProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899004(72-72)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899004
Sur SJin HChai LPanda DTorrellas JChatterjee S(2006)RDMA read based rendezvous protocol for MPI over InfiniBandProceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1122971.1122978(32-39)Online publication date: 29-Mar-2006
https://dl.acm.org/doi/10.1145/1122971.1122978
Danalis AKim KPollock LSwany MKramer W(2005)Transformations to Parallel Codes for Communication-Computation OverlapProceedings of the 2005 ACM/IEEE conference on Supercomputing10.1109/SC.2005.75Online publication date: 12-Nov-2005
https://dl.acm.org/doi/10.1109/SC.2005.75
Athanasaki MSotiropoulos ATsoukalas GKoziris NTsanakas P(2005)Hyperplane Grouping and Pipelined SchedulesThe Journal of Supercomputing10.1007/s11227-005-0298-833:3(197-226)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/s11227-005-0298-8
Athanasaki MSotiropoulos ATsoukalas GKoziris NGiles RReed DKelley K(2002)Pipelined scheduling of tiled nested loops onto clusters of SMPs using memory mapped network interfacesProceedings of the 2002 ACM/IEEE conference on Supercomputing10.5555/762761.762769(1-13)Online publication date: 16-Nov-2002
https://dl.acm.org/doi/10.5555/762761.762769
Sotiropoulos ATsoukalas GKoziris N(2002)Enhancing the Performance of Tiled Loop Execution onto Clusters Using Memory Mapped Network Interfaces and Pipelined SchedulesProceedings of the 16th International Parallel and Distributed Processing Symposium10.5555/645610.661056Online publication date: 15-Apr-2002
https://dl.acm.org/doi/10.5555/645610.661056
Goumas GAthanasaki MKoziris NLamont GHaddad HPapadopoulos GPanda B(2002)Automatic code generation for executing tiled nested loops onto parallel architecturesProceedings of the 2002 ACM symposium on Applied computing10.1145/508791.508961(876-881)Online publication date: 11-Mar-2002
https://dl.acm.org/doi/10.1145/508791.508961

Abstract

References

Cited By

Recommendations