skip to main content
10.5555/996070.1009889acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
Article

Array Composition and Decomposition for Optimizing Embedded Applications

Published: 09 November 2003 Publication History

Abstract

Optimizing array accesses is extremely critical in embedded computingas many embedded applications make use of arrays (in formof images, video frames, etc). Previous research considered bothloop and data transformations for improving array accesses. However,data transformations considered were mostly limited to lineardata transformations and array interleaving. In this paper, we introducetwo data transformations: array decomposition (breaking upa large array into multiple smaller arrays) and array composition(combining multiple small arrays into a single large array). Thispaper discusses that it is feasible to implement these optimizationswithin an optimizing compiler.

References

[1]
{1} F. Catthoor, S. Wuytack, E. D. Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle. Custom Memory Management Methodology - Exploration of Memory Organization for Embedded Multimedia System Design. Kluwer Academic Publishers, June 1998.
[2]
{2} M. Cierniak and W. Li. Unifying data and control transformations for distributed shared memory machines. In Proc. SIGPLAN '95 Conference on Programming Language Design and Implementation, June 1995.
[3]
{3} C. Ding and K. Kennedy. Inter-array data regrouping. In Proc. the Workshop on Languages and Compilers for Parallel Computing, San Diego, CA, August 4-6, 1999.
[4]
{4} W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and David Wonnacott. The Omega Library interface guide. Technical Report CS-TR-3445, CS Dept., University of Maryland, College Park, March 1995.
[5]
{5} S.-T. Leung and J. Zahorjan. Optimizing data locality by array restructuring. Technical Report TR 95-09-01, Dept. of Computer Science and Engineering, University of Washington, September 1995.
[6]
{6} W. Li. Compiling for NUMA Parallel Machines. Ph.D. Thesis, Computer Science Department, Cornell University, Ithaca, NY, 1993.
[7]
{7} K. McKinley, S. Carr, and C.W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 1996.
[8]
{8} M. O'Boyle and P. Knijnenburg. Non-singular data transformations: Definition, validity, applications. In Proc. 6th Workshop on Compilers for Parallel Computers, pages 287-297, Aachen, Germany, 1996.
[9]
{9} M. Wolf and M. Lam. A data locality optimizing algorithm. In Proc. ACM Conference on Programming Language Design and Implementation, pages 30-44, June 1991.
[10]
{10} M. Wolfe. High Performance Compilers for Parallel Computing , Addison-Wesley Publishing Company, 1996.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '03: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
November 2003
899 pages
ISBN:1581137621

Sponsors

Publisher

IEEE Computer Society

United States

Publication History

Published: 09 November 2003

Check for updates

Qualifiers

  • Article

Conference

ICCAD03
Sponsor:

Acceptance Rates

ICCAD '03 Paper Acceptance Rate 129 of 490 submissions, 26%;
Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 96
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media