Exact memory size estimation for array computations without loop unrolling

Ying Zhao, Sharad Malik
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecting area and power cost of memory units. For programs dealing mostly with array computations, memory cost is a dominant factor in the overall system cost. Thus, exact estimation of memory size required by a program is necessary to provide quantitative information for making high-level design decisions. Based on
more » ... d live v ariables analysis, our algorithm transforms the minimum memory size estimation into an equivalent problem: integer point counting for intersection union of mappings of parameterized polytopes. Then, a heuristics was proposed to solve the counting problem. Experimental results show that the algorithm achieves the exactness traditionally associated with totally-unrolling loops while exploiting the reduced computation complexity b y preserving original loop structure. _ ___________________________
doi:10.1145/309847.310074 dblp:conf/dac/ZhaoM99 fatcat:5jcwebm6n5bevgneayp3s6wrxe