메뉴 건너뛰기




Volumn , Issue , 2007, Pages 379-384

Fast memory footprint estimation based on maximal dependency vector calculation

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); INTERACTIVE COMPUTER GRAPHICS; LARGE SCALE SYSTEMS; OPTIMAL CONTROL SYSTEMS; SUPERVISORY AND EXECUTIVE PROGRAMS; VECTORS;

EID: 34548312056     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2007.364621     Document Type: Conference Paper
Times cited : (3)

References (16)
  • 1
    • 0001151864 scopus 로고
    • Background memory area estimation for multi-dimensional signal processing systems
    • June
    • F. Balasa, F. Catthoor, and H. De Man. Background memory area estimation for multi-dimensional signal processing systems. IEEE Trans. on VLSI Systems, 3(2): 157-172, June 1995.
    • (1995) IEEE Trans. on VLSI Systems , vol.3 , Issue.2 , pp. 157-172
    • Balasa, F.1    Catthoor, F.2    De Man, H.3
  • 3
    • 27444447639 scopus 로고    scopus 로고
    • Lattice-based memory allocation
    • Oct
    • A. Darte and Y. Robert. Lattice-based memory allocation. IEEE Transaction on Compuaters, 54(10): 1242-1257, Oct. 2005.
    • (2005) IEEE Transaction on Compuaters , vol.54 , Issue.10 , pp. 1242-1257
    • Darte, A.1    Robert, Y.2
  • 4
    • 0030675753 scopus 로고    scopus 로고
    • Array placement for storage size reduction in embedded multimedia systems
    • Zurich, Switzerland, July
    • E. De Greef, F. Catthoor, and H. De Man. Array placement for storage size reduction in embedded multimedia systems. In Proc. Int. Conf. on Applic.-Spec. Array Processors, pages 66-75, Zurich, Switzerland, July 1997.
    • (1997) Proc. Int. Conf. on Applic.-Spec. Array Processors , pp. 66-75
    • De Greef, E.1    Catthoor, F.2    De Man, H.3
  • 5
    • 0026174907 scopus 로고
    • Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis
    • San Jose CA, USA, Nov
    • C. H. Gebotys and M. I. Elmasry. Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis. In Proc. ACM/IEEE Design Automation Conf, San Jose CA, USA, Nov. 1991.
    • (1991) Proc. ACM/IEEE Design Automation Conf
    • Gebotys, C.H.1    Elmasry, M.I.2
  • 8
    • 0038105324 scopus 로고    scopus 로고
    • Data dependency size estimation for use in memory optimization
    • July
    • P. G. Kjeldsberg, F. Catthoor, and E. J. Aas. Data dependency size estimation for use in memory optimization. IEEE Trans. on Comp. Aided Design, 22(7):908-921, July 2003.
    • (2003) IEEE Trans. on Comp. Aided Design , vol.22 , Issue.7 , pp. 908-921
    • Kjeldsberg, P.G.1    Catthoor, F.2    Aas, E.J.3
  • 10
    • 34548332112 scopus 로고    scopus 로고
    • V. Loechner. Polylib: A library for manipulating parameterized polyhedra. Technical report
    • V. Loechner. Polylib: A library for manipulating parameterized polyhedra. Technical report.
  • 11
    • 0028714505 scopus 로고
    • Comprehensive lower bound estimation from behavioral description
    • San Jose CA, USA, Nov
    • S. Y. Ohm, F. J. Kurdahi, and N. Dutt. Comprehensive lower bound estimation from behavioral description. In Proc. IEEE Int. Conf. Comp. Aided Design, San Jose CA, USA, Nov. 1994.
    • (1994) Proc. IEEE Int. Conf. Comp. Aided Design
    • Ohm, S.Y.1    Kurdahi, F.J.2    Dutt, N.3
  • 12
    • 0026278958 scopus 로고
    • The omega test: A fast and practical integer programming algorithm for dependence analysis
    • Aug
    • W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Supercomputing, pages 4-13, Aug. 1991.
    • (1991) Supercomputing , pp. 4-13
    • Pugh, W.1
  • 13
    • 33646726553 scopus 로고    scopus 로고
    • Transformation to dynamic single assignment using a simple data flow analysis
    • Proc. 3rd Asian Symp. on Programming Languages and Systems ASPLAS, of, Tsukuba, Japan, Nov
    • P. Vanbroekhoven, G. Janssens, M. Bruynooghe, H. Corporaal, and F. Catthoor. Transformation to dynamic single assignment using a simple data flow analysis. In Proc. 3rd Asian Symp. on Programming Languages and Systems (ASPLAS), volume 3780 of Lecture Notes on Comp. Sc, pages 330-346, Tsukuba, Japan, Nov. 2005.
    • (2005) Lecture Notes on Comp. Sc , vol.3780 , pp. 330-346
    • Vanbroekhoven, P.1    Janssens, G.2    Bruynooghe, M.3    Corporaal, H.4    Catthoor, F.5
  • 15
    • 0032656355 scopus 로고    scopus 로고
    • Exact memory size estimation for array computations without loop unrolling
    • New Orleans, LA, June
    • Y. Zhao and S. Malik. Exact memory size estimation for array computations without loop unrolling. In Proc. 36th ACM/IEEE Design Automation Conf, pages 811-816, New Orleans, LA, June 1999.
    • (1999) Proc. 36th ACM/IEEE Design Automation Conf , pp. 811-816
    • Zhao, Y.1    Malik, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.