Article

Eliminating redundancies in sum-of-product array computations

Authors:

Steven J. Deitz,

Bradford L. Chamberlain, and

Lawrence SnyderAuthors Info & Claims

ICS '01: Proceedings of the 15th international conference on Supercomputing

June 2001

Pages 65 - 77

https://doi.org/10.1145/377792.377807

Published: 17 June 2001 Publication History

Abstract

Array programming languages such as Fortran 90, High Performance Fortran and ZPL are well-suited to scientific computing because they free the scientist from the responsibility of managing burdensome low-level details that complicate programming in languages like C and Fortran 77. However, these burdensome details are critical to performance, thus necessitating aggressive compilation techniques for their optimization. In this paper, we present a new compiler optimization called Array Subexpression Elimination (ASE) that lets a programmer take advantage of the expressibility afforded by array languages and achieve enviable portability and performance. We design a set of micro-benchmarks that model an important class of computations known as stencils and we report on our implementation of this optimization in the context of this micro-benchmark suite. Our results include a 125% improvement on one of these benchmarks and a 50% average speedup across the suite. Also we show a speedup of 32% improvement on the ZPL port of the NAS MG Parallel Benchmark and a 29% speedup over the hand-optimized Fortran version. Further, the compilation time is only negligibly affected.

References

[1]

M. Abramowitz and I. A. Stegun. Handbook of mathematical functions, with formulas, graphs, and mathematical tables. Dover Publications, 1973.

Digital Library

[2]

J. C. Adams, W. S. Brainerd, J. T. Martin, B. T. Smith, and J. L. Wagener. Fortran 90 Handbook. McGraw-Hill, 1992.

Digital Library

[3]

A. V. Aho, S. C. Johnson, and J. D. Ullman. Code generation for expressions with common subexpressions. Journal of the ACM, 24(1):146-160, January 1977.

Digital Library

[4]

D. Bailey, E. Barszcz, J. Barton, D. Browning, R. Carter, L. Dagum, R. Fatoohi, S. Fineberg, P. Frederickson, T. Lasinski, R. Schreiber, H. Simon, V. Venkatakrishnan, and S. Weeratunga. The NAS parallel benchmarks (94). Technical report, RNR Technical Report RNR-94-007, March 1994.

[5]

D. Bailey, T. Harris, W. Saphir, R. van der Wijngaart, A. Woo, and M. Yarrow. The NAS parallel benchmarks 2.0. Technical report, NAS Report NAS-95-020, December 1995.

[6]

R. G. Brickner, K. Holian, B. Thiagarajan, and S. L. Johnson. A stencil compiler for the connection machine model cm-5. Technical report, Center for Research onParallel Computation CRPC-TR94457, June 1994.

[7]

M. Bromley, S. Heller, T. McNerney, and G. L. S. Jr. Fortran at ten giga ops: The connection machine convolution compiler. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, 1991.

Digital Library

[8]

D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, 1990.

Digital Library

[9]

S. Carr and K. Kennedy. Scalar replacement inthe presence of conditional control ow. Software - Practice and Experience, 24(1):51-77, January 1994.

Digital Library

[10]

C. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein. Register allocation via coloring. Computer Languages, 6:45-57, January 1981.

[11]

B. L. Chamberlain, S. J. Deitz, and L. Snyder. A comparative study of the nas mg benchmark across parallel languages and architectures. In Proceedings of Supercomputing '00: High Performance Networking and Computing, 2000.

Digital Library

[12]

M. D. Ernst. Serializing parallel programs by removing redundant computation. Technical report, Microsoft Research Technical Report MSR-TR-94-15, August 1994.

Digital Library

[13]

A. L. Fisher and P. T. Highnam. Communication and code optimization in simd programs. In International Conference onParallel Processing, 1988.

[14]

A. L. Fisher, J. Leon, and P. T. Highnam. Design and performance of an optimizing simd compiler. In Frontiers of Massively Parallel Computation, 1990.

[15]

R. M. Haralick and L. G. Shapiro. Computer and Robot Vision. Addison-Wesley, 1992.

Digital Library

[16]

High Performance Fortran Forum. High Performance Fortran Langauge Specification, Version 2.0. January 1997.

[17]

E. C. Lewis, C. Lin, and L. Snyder. The implementation and evaluation of fusion and contraction in array languages. In Proceedings of the SIGPLAN '98 Conference onProgramming Language Design and Implementation, 1998.

Digital Library

[18]

Y. Liu and S. Stoller. Loop optimization for aggregate array computations. In Proceedings of the IEEE 1998 International Conference on Computer Languages, 1998.

Digital Library

[19]

G. Roth, J. Mellor-Crummey, K. Kennedy, and R. G. Brickner. Compiling stencils in high performance fortran. In Proceedings of Supercomputing '97: High Performance Networking and Computing, 1997.

Digital Library

[20]

L. Snyder. Programming Guide to ZPL. MIT Press, 1999.

Digital Library

Cited By

Zhao QChabbi MLiu X(2024)EasyView: Bringing Performance Profiles into Integrated Development Environments2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO57630.2024.10444840(386-398)Online publication date: 2-Mar-2024
https://doi.org/10.1109/CGO57630.2024.10444840
Antepara OWilliams SJohansen HZhao THirsch SGoyal PHall M(2023)Performance Portability Evaluation of Blocked Stencil Computations on GPUsProceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624177(1007-1018)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624177
You XYang HLei KLuan ZQian DMohror KArnold DBadia R(2023)TrivialSpy: Identifying Software Triviality via Fine-grained and Dataflow-based Value ProfilingProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607052(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607052
Show More Cited By

Index Terms

Eliminating redundancies in sum-of-product array computations
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

Eliminating partially-redundant array-bounds check in the Android Dalvik JIT compiler
PPPJ '11: Proceedings of the 9th International Conference on Principles and Practice of Programming in Java

The Android operating system has transformed the mobile software platform landscape significantly. A significant component of the Android is the Dalvik Virtual Machine (DVM) that interprets client applications' codes written in Java and compiled to ...
Read More
Exploiting Implicit Parallelism in Dynamic Array Programming Languages
ARRAY'14: Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming

We have built an interpreter for the array programming language J. The interpreter exploits implicit data parallelism in the language to achieve good parallel speedups on a variety of benchmark applications.

Many array programming languages operate on ...
Read More
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML

With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desirable features of contemporary typed functional languages: static typing ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '01: Proceedings of the 15th international conference on Supercomputing

June 2001

510 pages

ISBN:158113410X

DOI:10.1145/377792

Chairmen:
Mario Mango Furnari
Istituto di Cibernetica, CNR, Italy
,
Efstratios Gallopoulos
Univ. of Patras

Copyright © 2001 ACM.

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]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS01

Sponsor:

SIGARCH

ICS01: 15th International Conference on Supercomputing

Sorrento, Italy

Acceptance Rates

ICS '01 Paper Acceptance Rate 45 of 133 submissions, 34%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
259
Total Downloads

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

Other Metrics

View Author Metrics

Citations

Cited By

Zhao QChabbi MLiu X(2024)EasyView: Bringing Performance Profiles into Integrated Development Environments2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO57630.2024.10444840(386-398)Online publication date: 2-Mar-2024
https://doi.org/10.1109/CGO57630.2024.10444840
Antepara OWilliams SJohansen HZhao THirsch SGoyal PHall M(2023)Performance Portability Evaluation of Blocked Stencil Computations on GPUsProceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624177(1007-1018)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624177
You XYang HLei KLuan ZQian DMohror KArnold DBadia R(2023)TrivialSpy: Identifying Software Triviality via Fine-grained and Dataflow-based Value ProfilingProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607052(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607052
Li KYuan LZhang YYue Yde Supinski BHall MGamblin T(2021)Reducing redundancy in data organization and arithmetic calculation for stencil computationsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3458817.3476154(1-15)Online publication date: 14-Nov-2021
https://dl.acm.org/doi/10.1145/3458817.3476154
You XYang HLuan ZQian DLiu XCuicchi CQualters IKramer W(2020)ZeroSpyProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.5555/3433701.3433739(1-14)Online publication date: 9-Nov-2020
https://dl.acm.org/doi/10.5555/3433701.3433739
Tan JJiao SChabbi MLiu XAyguadé EHwu WBadia RHofstee H(2020)What every scientific programmer should know about compiler optimizations?Proceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392754(1-12)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392754
Luporini FLouboutin MLange MKukreja NWitte PHückelheim JYount CKelly PHerrmann FGorman G(2020)Architecture and Performance of Devito, a System for Automated Stencil ComputationACM Transactions on Mathematical Software10.1145/337491646:1(1-28)Online publication date: 26-Apr-2020
https://dl.acm.org/doi/10.1145/3374916
You XYang HLuan ZQian DLiu X(2020)ZeroSpy: Exploring Software Inefficiency with Redundant ZerosSC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00033(1-14)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00033
Chi YCong J(2020)Exploiting Computation Reuse for Stencil Accelerators2020 57th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC18072.2020.9218680(1-6)Online publication date: Jul-2020
https://doi.org/10.1109/DAC18072.2020.9218680
Yuan LHuang SZhang YCao H(2019)Tessellating Star StencilsProceedings of the 48th International Conference on Parallel Processing10.1145/3337821.3337835(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3337821.3337835
Show More Cited By

View Options

Get Access

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents