DocumentCode :
1423160
Title :
Exact memory size estimation for array computations
Author :
Zhao, Ying ; Malik, Sharad
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., NJ, USA
Volume :
8
Issue :
5
fYear :
2000
Firstpage :
517
Lastpage :
521
Abstract :
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Based on parametric partitioning of the iteration space and formalized live variable analysis, our algorithm transforms the minimum memory size estimation into an equivalent problem: integer point counting for intersection/union of mappings of parameterized polytopes. A heuristics was then proposed to solve the counting problem. Experimental results show that the algorithm achieves the exactness traditionally associated with totally unrolling loops while exploiting reduced computation complexity by preserving the original loop structure.
Keywords :
VLSI; circuit optimisation; computational complexity; high level synthesis; integrated circuit design; iterative methods; logic partitioning; array computations; computation complexity; exact memory size estimation; formalized live variable analysis; integer point counting; iteration space; loop structure; parameterized polytopes; parametric partitioning; totally unrolling loops; Algorithm design and analysis; Area measurement; Cost function; Design optimization; Digital signal processing; Energy consumption; Partitioning algorithms; Power measurement; Scheduling; Velocity measurement;
fLanguage :
English
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-8210
Type :
jour
DOI :
10.1109/92.894155
Filename :
894155
Link To Document :
بازگشت