Article

Free access

Non-singular data transformations: definition, validity and applications

Authors:

M. F. P. O'Boyle,

P. M. W. KnijnenburgAuthors Info & Claims

ICS '97: Proceedings of the 11th international conference on Supercomputing

Pages 309 - 316

https://doi.org/10.1145/263580.263655

Published: 11 July 1997 Publication History

PDF eReader

References

[1]

J.M. Anderson S.P. Amarasinghe and MS. Lam. Data and Computation nanslbrmationm for Muitiprocessors, Proc. of Principles and Practice of Parallel Programming, ACM Press, 1995.

Digital Library

Google Scholar

[2]

U. Banerjee. Unimoduiar 'IhnmEormatiotu of Double Loops, Proc. of 3rd Workshop on Programming Languages and Compilers for Parallel Computing, Irvine CA, August 1990.

Google Scholar

[3]

F. Bodin and M.F.P. O'Boyie. A Compiler Strategy for SVM Third Workshop on Languages, Compilers and Runtime Systems, New York, Kiuwer Press, May 1995.

Google Scholar

[4]

P.R. Cappeilo and S. Kenneth. Unifying VLSI Designs with Linear tinsformations of Spree-Time, Advances in Computing Research, Vol 2., JAI press, 1984.

Google Scholar

[5]

S. Chatterjee, J.R. Gilbert, R. Schreiber and S-H. Teng. Automatic Array Alignment in Data Parallel Programs, Proc. of Principles of Programming Languages, Charleston, ACM Press, January 1993.

Digital Library

Google Scholar

[6]

A. Choudhary, G. Fbx, S. Hiranandani, K.Kennedy, C. Koelbei, S. Ranka and C.-W. Tseng. Unifled Compilation of Fortran 77D and 90D, ACM Letters on Programming Languages and Systems Vol2 Noe 1-4, March - December 1993.

Digital Library

Google Scholar

[7]

M. Clerniak and W. Li. Unifying Data and Control nansformations for Distributed Shared-Memory Machines, Programming Language Design and implementation, June 1995.

Digital Library

Google Scholar

[8]

Cannon D. and Jalby W. Strategies for Cache and Local Memory Management by Gioai Program Transformation, Journal of Parallel and Distributed Computing, 1988.

Digital Library

Google Scholar

[9]

T.E.Jeremisssen and S.J. Eggers, Reducing False Sharing on Shared Memory Multiprocessors through Compile-Time Data Transformations. Proc. of Principles and Practice of Parallel Programming, ACM Press, 1995.

Digital Library

Google Scholar

[10]

W.A.Keiiy, W.Pugh, A Framework for Unifying Reordering Transformations Tech Report CS-TR-3193, Dept CS, Univ. Maryland, May 1993.

Digital Library

Google Scholar

[11]

D. Kuikarni sad M. Stumm. CDA Loop Transformations, Languages, Compilers and Run-Time Systems for Scalable Computers, Kluwer Academic Press, May 1995.

Google Scholar

[12]

D. Kuikarni and M. Stumm. Loop and Data Transformations: A Tutorial University of Toronto, Tech Rep CSRI- 337, June 1993.

Google Scholar

[13]

P.M.W. Knijnenburg, E. Aygusde and J. Torres. Multitransformations of Nested Loop for Parallelising Compilers, Tech. Rep. 96-14, Leiden University, 1996.

Google Scholar

[14]

J. Li and M. Chen. Index Domain Alignment: Minimising Cost of Cross-Referencing between Distributed Arrays, IEEE Proc. of the Third Symposium on the Frontiers of Massively Parallel Computation, 1990.

Crossref

Google Scholar

[15]

W. Li and K. Pingali. Access Normalisation: Loop Restructuring for NUMA Compilers Cornell University, Department of Computer Science, TR92-12f8, April 1992.

Digital Library

Google Scholar

[16]

W. Li and K. Pingali. A Singular Loop Transformation framework Based on Non-singular Matrices, Proc. of the Fifth Workshop on Languages and Compilers for Parallelism, August 1992.

Digital Library

Google Scholar

[17]

M.F.P. O'Boyle and G.A. Hedayat. Data Alignment: Transformation to Reduce Communication on Distributed Memory Architectures, Proc. of Scalable High Performance Computing Conference, Williamsburg, IEEE Press, April 1992.

Crossref

Google Scholar

[18]

M.F.P O'Boyle and P.M.W Knijnenberg, Non-Singular Data Transformations: Definition, Validity and Application Leiden University Technical Report 96-16, June 1996.

Google Scholar

[19]

O.Temam, E.D. Granston and W.Jalby. To Copy or Not To Copy: A compile-time technique for assessing when data copying should be used, Proc. of Supercomputing '93. Portland Oregon, Nov. 1993.

Digital Library

Google Scholar

[20]

ME. Wolf and M. Lam. An Algorithmic Approach to Compound Loop Transformations, in Advances in Languages and Compilers for Parallel Processing, A. Nicolau, D. Gelernter, T. Gross and D. Padua (eds.), Pitman London, 1991.

Google Scholar

Cited By

View all

Huzaifa MAlsop JMahmoud ASalvador GSinclair MAdve S(2020)Inter-kernel Reuse-aware Thread Block SchedulingACM Transactions on Architecture and Code Optimization10.1145/340653817:3(1-27)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3406538
Sioutas SStuijk SBasten TCorporaal HSomers L(2020)Schedule Synthesis for Halide Pipelines on GPUsACM Transactions on Architecture and Code Optimization10.1145/340611717:3(1-25)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3406117
Cerina LSantambrogio MFranco GGallicchio CMicheli A(2020)EchoBayACM Transactions on Architecture and Code Optimization10.1145/340499317:3(1-24)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3404993
Show More Cited By

Index Terms

Non-singular data transformations: definition, validity and applications

Recommendations

Enabling unimodular transformations
Supercomputing '94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing

The development of a unimodular transformation theory and associated algorithms has renewed interest in Fortran do loops that are not perfectly (or tightly) nested. In this paper we summarize a number of techniques that convert imperfectly nested loops ...
Transformations techniques for extracting parallelism in non-uniform nested loops

Executing a program in parallel machines needs not only to find sufficient parallelism in a program, but it is also important that we minimize the synchronization and communication overheads in the parallelized program. This yields to improve the ...
Affine and unimodular transformations for non-uniform nested loops
ICCOMP'08: Proceedings of the 12th WSEAS international conference on Computers

Performance improvement in the modern parallel machines needs not only to find sufficient parallelism in a program, but it is also important that we minimize the synchronization and communication overheads in the parallelized program. Parallelizing and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '97: Proceedings of the 11th international conference on Supercomputing

July 1997

347 pages

ISBN:0897919025

DOI:10.1145/263580

Chairmen:
Steven J. Wallach
Hewlett-Packard/Convex
,
Hans Zima
Univ., of Vienna, Vienna, Austria

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: 11 July 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS97

Sponsor:

SIGARCH

ICS97: 1997 International Conference on Supercomputing

July 7 - 11, 1997

Vienna, Austria

Acceptance Rates

ICS '97 Paper Acceptance Rate 45 of 135 submissions, 33%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
372
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)10

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huzaifa MAlsop JMahmoud ASalvador GSinclair MAdve S(2020)Inter-kernel Reuse-aware Thread Block SchedulingACM Transactions on Architecture and Code Optimization10.1145/340653817:3(1-27)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3406538
Sioutas SStuijk SBasten TCorporaal HSomers L(2020)Schedule Synthesis for Halide Pipelines on GPUsACM Transactions on Architecture and Code Optimization10.1145/340611717:3(1-25)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3406117
Cerina LSantambrogio MFranco GGallicchio CMicheli A(2020)EchoBayACM Transactions on Architecture and Code Optimization10.1145/340499317:3(1-24)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3404993
Ding WTang XKandemir MZhang YKultursay E(2015)Optimizing off-chip accesses in multicoresACM SIGPLAN Notices10.1145/2813885.273798950:6(131-142)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737989
Ding WTang XKandemir MZhang YKultursay EGrove DBlackburn S(2015)Optimizing off-chip accesses in multicoresProceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2737924.2737989(131-142)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2737924.2737989
Tuch AHornbæk K(2015)Does Herzberg's Notion of Hygienes and Motivators Apply to User Experience?ACM Transactions on Computer-Human Interaction10.1145/272471022:4(1-24)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2724710
Jelenkovic PSkiani E(2014)Is sharing with retransmissions causing instabilities?ACM SIGMETRICS Performance Evaluation Review10.1145/2637364.259200142:1(167-179)Online publication date: 16-Jun-2014
https://dl.acm.org/doi/10.1145/2637364.2592001
Khan SLee DKim YAlameldeen AWilkerson CMutlu O(2014)The efficacy of error mitigation techniques for DRAM retention failuresACM SIGMETRICS Performance Evaluation Review10.1145/2637364.259200042:1(519-532)Online publication date: 16-Jun-2014
https://dl.acm.org/doi/10.1145/2637364.2592000
Ding WKandemir M(2014)CApRIACM SIGMETRICS Performance Evaluation Review10.1145/2637364.259199242:1(477-489)Online publication date: 16-Jun-2014
https://dl.acm.org/doi/10.1145/2637364.2591992
Ok JJin YShin JYi Y(2014)On maximizing diffusion speed in social networksACM SIGMETRICS Performance Evaluation Review10.1145/2637364.259199142:1(301-313)Online publication date: 16-Jun-2014
https://dl.acm.org/doi/10.1145/2637364.2591991
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Enabling unimodular transformations

Transformations techniques for extracting parallelism in non-uniform nested loops

Affine and unimodular transformations for non-uniform nested loops