Memory size computation for real-time multimedia applications based on polyhedral decomposition

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 12, 2006, Pages 3378-3386

  Zhu, Hongwei ^a   Luican, Ilie I ^a   Balasa, Florin ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

Computation of storage requirements; Memory allocation; Multi dimensional signal processing; Multimedia processing applications; Polyhedra

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; DATA TRANSFER; MULTIMEDIA SYSTEMS; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER);

COMPUTATION OF STORAGE REQUIREMENTS; MULTI-DIMENSIONAL SIGNAL PROCESSING; MULTIMEDIA PROCESSING APPLICATIONS;

REAL TIME SYSTEMS;

EID: 33845584095     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.12.3378     Document Type: Article

References (18)

1. D. Avis, "lrs: A revised implementation of the reverse search vertex enumeration algorithm," in Polytopes - Combinatorics and Computation, ed. G. Kalai and G. Ziegler, pp.177-198, Birkhauser-Verlag, 2000.
2. F. Balasa, F. Catthoor, and H. De Man, "Background memory area estimation for multi-dimensional signal processing systems," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.3, no.2, pp.157-172, June 1995.
3. A.I. Barvinok, "A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed," Math. Oper. Res., vol.19, no.4, pp.769-779, Nov. 1994.
4. A.I. Barvinok and J. Pommersheim, "An algorithmic theory of lattice points in polyhedra," in New Perspectives in Algebraic Combinatorics, pp.91-147, Cambridge Univ. Press, 1999.
5. F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle, Custom Memory Management Methodology: Exploration of Memory Organization for Embedded Multimedia System Design, Kluwer Academic Publ., Boston, 1998.
6. Ph. Clauss and V. Loechner, "Parametric analysis of polyhedral iteration spaces," J. VLSI Signal Process., vol.19, no.2, pp.179-194, 1998.
7. G.B. Dantzig and B.C. Eaves, "Fourier-Motzkin elimination and its dual," J. Comb. Theory A, vol.14, pp.288-297, 1973.
8. J.A. De Loera, R. Hemmecke, J. Tauzer, and R. Yoshida, "Effective lattice point counting in rational convex polytopes," J. Symbol. Comput., vol.38, no.4, pp.1273-1302, 2004.
9. P.G. Kjeldsberg, F. Catthoor, and E,J. Aas, "Data dependency size estimation for use in memory optimization," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.22, no.7, pp.908-921, July 2003.
10. F.J. Kurdahi and A.C. Parker, "REAL: A program for register allocation," Proc. 24th Design Automation Conf., pp.210-215, 1987.
11. S.S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufmann, San Francisco, 1997.
12. W. Pugh, "A practical algorithm for exact array dependence analysis," Commun. ACM, vol.35, no.8, pp.102-114, Aug. 1992.
13. J. Ramanujam, J. Hong, M. Kandemir, and A. Narayan, "Reducing memory requirements of nested loops for embedded systems," Proc. 38th ACM/IEEE Design Automation Conf., pp.359-364, June 2001.
14. A. Schrijver, Theory of Linear and Integer Programming, John Wiley, New York, 1986.
15. L. Thiele, "Compiler techniques for massive parallel architectures," in State-of-the-art in Computer Science, ed. P. Dewilde, Kluwer Acad. Publ., 1992.
16. I. Verbauwhede, C. Scheers, and J.M. Rabaey, "Memory estimation for high level synthesis," Proc. 31st ACM/IEEE Design Automation Conf., pp.143-148, June 1994.
17. Y. Zhao and S. Malik, "Exact memory size estimation for array computations," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.8, no.5, pp.517-521, 2000.
18. H. Zhu, I.I. Luican, and F. Balasa, "Memory size computation for multimedia processing applications," Proc. Asia & South-Pacific Design Automation Conf., pp.802-807, Yokohama, Japan, Jan. 2006.