M. E. Wolf and M. S. Lain, "A Loop Transformation Theory and an Algorithm to Maximize Parallelism,~ IEEE Trans. on Parallel and Distributed Systems, Vol. 2, pp. 452-471, 1991.

Digital Library

Google Scholar

[9]

M. E. Wolf and M. S. Lain, "A Data Locality Optimizing Algorithm,' A CM SIGPLAN '91 Coal on Programming Language Design and Implementation, pp. 30-44, 1991.

Digital Library

Google Scholar

[10]

J. Ramanujam and P. Saday~ppan, "Tiling Multidimensional Iteration Spaces for Multicomputers,' J. of Paralld and Distributed Computing, Vol. 16, pp. 108- 120, 1992.

Crossref

Google Scholar

[11]

S. Hiranandani, K. Kennedy, and C.-W. Tseng, "Evaluating Compiler Optimizations for Fortran D,' J. of Parallel and Distributed Computing, Vol. 21, pp. 27- 45, 1994.

Digital Library

Google Scholar

[12]

A. Rogers and K. Pingali, "Compiling for Distributed Memory Architectures,' IEEE Trans. oa Para//e/and Distributed Systems, Vol. 5, pp. 281-298~ 1994.

Digital Library

Google Scholar

[13]

P. Tang and J. N. Zigman, "Redudng Data Communication Overhead for DOACROSS Loop Nests," 1994 ACM Intq Conf. on $upercomputing, pp. 44-53, 1994.

Digital Library

Google Scholar

[14]

E. Montagne, M. Rukoz, R. Suros, and F. Breant, "Modeling Optimal Granularity When AdaLpting Systolic Algorithms to Transputer Based Supercomputers,' Paxa//e/Computing, Vol. 20, pp. 807-614, 1994.

Digital Library

Google Scholar

Cited By

View all

Cui HDahnoun N(2019)Exploiting Task-based Parallelism in Application Loops2019 8th Mediterranean Conference on Embedded Computing (MECO)10.1109/MECO.2019.8760146(1-5)Online publication date: Jun-2019
https://doi.org/10.1109/MECO.2019.8760146
Chen YShang WFang Y(2017)Supernode transformation on computer clusters2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)10.1109/UMEDIA.2017.8074109(1-6)Online publication date: Aug-2017
https://doi.org/10.1109/UMEDIA.2017.8074109
Chen YShang W(2017)Supernode transformation on GPGPUsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2017.129614734:2(181-202)Online publication date: 16-Mar-2017
https://doi.org/10.1080/17445760.2017.1296147
Show More Cited By

Index Terms

Optimal tile size adjustment in compiling general DOACROSS loop nests

Recommendations

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 ...
Reducing data communication overhead for DOACROSS loop nests
ICS '94: Proceedings of the 8th international conference on Supercomputing

If the iterations of a loop nest cannot be partitioned into independent tasks, data communication for data dependence is inevitable in order to execute them on parallel machines. This kind of loop nest is referred to as a DOACROSS loop nest.

This paper ...
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests

Linear loop transformations and tiling are known to be very effective for enhancing locality of reference in perfectly-nested loops. However, they cannot be applied directly to imperfectly-nested loops. Some compilers attempt to convert imperfectly-...

Comments

Information & Contributors

Information

Published In

ICS '95: Proceedings of the 9th international conference on Supercomputing

July 1995

448 pages

ISBN:0897917286

DOI:10.1145/224538

Chairman:
Mateo Valero
Univ. Polite`cnica de Catalunya

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS95

Sponsor:

Univ Politecnica del Catalunya
SIGARCH
Oregon Graduate Institute

ICS95: 1995 International Conference on Supercomputing

July 3 - 7, 1995

Barcelona, Spain

Acceptance Rates

ICS '95 Paper Acceptance Rate 49 of 120 submissions, 41%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
334
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)3

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cui HDahnoun N(2019)Exploiting Task-based Parallelism in Application Loops2019 8th Mediterranean Conference on Embedded Computing (MECO)10.1109/MECO.2019.8760146(1-5)Online publication date: Jun-2019
https://doi.org/10.1109/MECO.2019.8760146
Chen YShang WFang Y(2017)Supernode transformation on computer clusters2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)10.1109/UMEDIA.2017.8074109(1-6)Online publication date: Aug-2017
https://doi.org/10.1109/UMEDIA.2017.8074109
Chen YShang W(2017)Supernode transformation on GPGPUsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2017.129614734:2(181-202)Online publication date: 16-Mar-2017
https://doi.org/10.1080/17445760.2017.1296147
Zhou XGarzarán MPadua D(2015)Optimal Parallelogram Selection for Hierarchical TilingACM Transactions on Architecture and Code Optimization10.1145/268741411:4(1-23)Online publication date: 9-Jan-2015
https://dl.acm.org/doi/10.1145/2687414
Bakhanovich SSobolevskii P(2011)Tiling optimization for the solution of two-dimensional time-dependent heat equationComputational Mathematics and Mathematical Physics10.1134/S096554251104002651:4(586-596)Online publication date: 1-May-2011
https://doi.org/10.1134/S0965542511040026
Robert YVivien F(2010)Algorithmic issues in grid computingAlgorithms and theory of computation handbook10.5555/1882723.1882752(29-29)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1882723.1882752
Sobolevsky PBakhanovich SGorbach A(2010)Tiling optimization in numerically solving a multidimensional heat equation on a ring of processorsCybernetics and Systems Analysis10.1007/s10559-010-9193-246:1(145-152)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1007/s10559-010-9193-2
Rajopadhye SRenganarayana LMills Strout MGautam (2009)Computations on Iteration SpacesThe Compiler Design Handbook10.1201/9781420043839.ch15(15-1-15-52)Online publication date: 7-Dec-2009
https://doi.org/10.1201/9781420043839.ch15
Goumas GDrosinos NKoziris N(2009)Communication-Aware Supernode ShapeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2008.11420:4(498-511)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1109/TPDS.2008.114
Renganarayana LRajopadhye STeller P(2008)Positivity, posynomials and tile size selectionProceedings of the 2008 ACM/IEEE conference on Supercomputing10.5555/1413370.1413426(1-12)Online publication date: 15-Nov-2008
https://dl.acm.org/doi/10.5555/1413370.1413426
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Tiling imperfectly-nested loop nests

Reducing data communication overhead for DOACROSS loop nests

Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests