Loop optimization for aggregate array computations

@article{Liu1998LoopOF,
  title={Loop optimization for aggregate array computations},
  author={Yanhong A. Liu and Scott D. Stoller},
  journal={Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225)},
  year={1998},
  pages={262-271}
}
  • Yanhong A. Liu, Scott D. Stoller
  • Published in
    Proceedings of the…
    1998
  • Computer Science
  • An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations of loops, resulting in significant redundancy in the overall computation. The paper presents a method and algorithms that eliminate such overlapping aggregate array redundancies and shows both analytical and experimental performance improvements… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 17 CITATIONS

    Strengthening invariants for efficient computation

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS

    Eliminating redundancies in sum-of-product array computations

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Efficiency by Incrementalization: An Introduction

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND

    Static caching for incremental computation

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND

    Principled strength reduction

    VIEW 2 EXCERPTS
    CITES METHODS

    Preserving application reliability on unreliable hardware

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Low-cost program-level detectors for reducing silent data corruptions

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 63 REFERENCES