Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home

Technical Reports

printable version

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

Click here for full text: Postscript PDF

Near-Optimal Allocation of Local Memory Arrays

Schreiber, Robert; Cronquist, Darren C.


Keyword(s): scratch pad memory; affine reference

Abstract: This paper considers compiler management of fast, local memories for loop nests that contain affine array references. We show how to reduce the local memory footprint of such arrays by doing an affine reindexing of the array elements. We approximate the best reindexing by a two-step algorithm. The first step uses a generalized Hermite factorization, and the second uses a one-norm lattice basis reduction technique. We improve on earlier work in which a local memory array stores the smallest rectangular subarray of the elements referenced in the loop nest. Our techniques apply directly to nests with families of uniformly generated affine references, and we propose ways to extend them to more general situations.

23 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.