Ying Zhao
- 1.A.Sudarsanam. Code optimization libraries for retargetable compilation for embedded digital signal processors. Phd thesis, Princeton University, May 1998. Google Scholar
Digital Library
- 2.P. Clauss. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs, lOth ACM Int. Conf. on Supercomputing, May 1996. Google ScholarDigital Library
- 3.P. Clauss. ttandling memory cache policy with integer points countings. Euro-Par'9?, pages 285-293, 1997. Google ScholarDigital Library
- 4.H. M. g. De Greef, F.Catthoor. Array placement for storage size reduction in embedded multimedia systems. 11th International Con/erence on Applicationspecij~c Systems, Architectures and processors, July 1997. Google ScholarDigital Library
- 5.H. D. M. F. Balasa, F. Catthoor. Background memory area estimation for multi-dimensional signal processing systems. IEEE Trans. on Comp-aided Design, CAD-14, 1995. Google ScholarDigital Library
- 6.A. F.J.Kurdahi. Real: a program for register allocation. Proc. 2~4th DAC, pages 210-215, June 1987. Google ScholarDigital Library
- 7.C. Lengauer. Loop parallelization in the polytope model. in e.best. CONCUR'93, Lecture Notes in Computer Science 715, pages 398-416, 1993. Google ScholarDigital Library
- 8.W. Pugh. Counting solutions to presburger formulas: How and why. Proc. o/the 199~ A CM $fGPLAN Conference on Programming Language Design and Implementation, 1994. Google ScholarDigital Library
- 9.A. Sudarsanam and S. Malik. Simultaneous reference allocation in code generation for dual data memory bank asips. To be published in A CM Transactions on Design Automation/or Electronic Systems, 1999. Google ScholarDigital Library
Index Terms
- Exact memory size estimation for array computations without loop unrolling
Recommendations
Exact memory size estimation for array computations
Special issue on the 11th international symposium on system-level synthesis and design (ISSS'98)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 ...
Timing optimization via nest-loop pipelining considering code size
Embedded systems have strict timing and code size requirements. Software pipelining is one of the most important optimization techniques to improve the execution time of loops by increasing the parallelism among successive loop iterations. However, ...
Comments