메뉴 건너뛰기




Volumn 12, Issue 4, 2007, Pages

Incremental hierarchical memory size estimation for steering of loop transformations

Author keywords

Code transformation; Data optimization; High level synthesis; Memory architecture exploration; Memory size estimation

Indexed keywords

CODE TRANSFORMATION; DATA OPTIMIZATION; HIGH-LEVEL SYNTHESIS; MEMORY ARCHITECTURE EXPLORATION; MEMORY SIZE ESTIMATION;

EID: 35148879778     PISSN: 10844309     EISSN: 15577309     Source Type: Journal    
DOI: 10.1145/1278349.1278363     Document Type: Article
Times cited : (10)

References (41)
  • 1
    • 0028743437 scopus 로고    scopus 로고
    • BACON, D. F., GRAHAN, S. L., AND SHARP, O. J. 1994. Compiler transformations for high-performance computing. ACM Comput. Surv. 26, 4 (Dec.), 245-20.
    • BACON, D. F., GRAHAN, S. L., AND SHARP, O. J. 1994. Compiler transformations for high-performance computing. ACM Comput. Surv. 26, 4 (Dec.), 245-20.
  • 2
    • 84888746740 scopus 로고    scopus 로고
    • BALASA, F, CATTHOOR, R, AND DE MAN, H. 1995. Background memory area estimation for multidimensional signal processing systems. IEEE Trans. VLSI Syst. 3, 2 (Jun.), 157-172.
    • BALASA, F, CATTHOOR, R, AND DE MAN, H. 1995. Background memory area estimation for multidimensional signal processing systems. IEEE Trans. VLSI Syst. 3, 2 (Jun.), 157-172.
  • 4
    • 0003003638 scopus 로고
    • A study of replacement algorithms for a virtual-storage computer. ZBAf
    • BELADY, L. 1966. A study of replacement algorithms for a virtual-storage computer. ZBAf Syst. J. 5, 6, 78-101.
    • (1966) Syst. J , vol.5 , Issue.6 , pp. 78-101
    • BELADY, L.1
  • 5
    • 0001912576 scopus 로고    scopus 로고
    • BENINI, L., MACH, A., AND PONCING, M. 2000. Increasing energy efficiency of embedded systems by application-specific memory hierarchy generation. IEEE Des. Test Comput. 17, 2 (Apr.), 74-85.
    • BENINI, L., MACH, A., AND PONCING, M. 2000. Increasing energy efficiency of embedded systems by application-specific memory hierarchy generation. IEEE Des. Test Comput. 17, 2 (Apr.), 74-85.
  • 6
    • 84888662948 scopus 로고    scopus 로고
    • BEYLS, K. AND D'HOLLANDER, E. 2001. Reuse distance as a metric for cache behavior. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, T. Gonzalez, Ed. (Anaheim, CA), 617-622.
    • BEYLS, K. AND D'HOLLANDER, E. 2001. Reuse distance as a metric for cache behavior. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, T. Gonzalez, Ed. (Anaheim, CA), 617-622.
  • 8
    • 84888675468 scopus 로고    scopus 로고
    • CATTHOOR, F., C. KULKARNI, K.D., BROCKMEYER, E., KJELDSBERG, P.G., VAN ACHTEREN, T., AND OMNES, T. 2002. Data Access and Storage Management for Embedded Programmable Processors. Kluwer Academic, Boston, MA.
    • CATTHOOR, F., C. KULKARNI, K.D., BROCKMEYER, E., KJELDSBERG, P.G., VAN ACHTEREN, T., AND OMNES, T. 2002. Data Access and Storage Management for Embedded Programmable Processors. Kluwer Academic, Boston, MA.
  • 10
    • 35048850130 scopus 로고    scopus 로고
    • A polyhedral approach to ease the composition of program transformations
    • Proceedings of the EuroPar Conference Pisa, Italy, Springer
    • COHEN, A., GIRBAL, S., AND TEMAM, O. 2004. A polyhedral approach to ease the composition of program transformations. In Proceedings of the EuroPar Conference (Pisa, Italy). Lecture Notes in Computer Science vol. 3149. Springer, 292-303.
    • (2004) Lecture Notes in Computer Science , vol.3149 , pp. 292-303
    • COHEN, A.1    GIRBAL, S.2    TEMAM, O.3
  • 12
    • 0033689152 scopus 로고    scopus 로고
    • On the complexity of loop fusion
    • DARTE, A. 2000. On the complexity of loop fusion. Parallel Comput. 26, 9, 1175-1193.
    • (2000) Parallel Comput , vol.26 , Issue.9 , pp. 1175-1193
    • DARTE, A.1
  • 13
    • 0001880002 scopus 로고    scopus 로고
    • DARTE, A. AND ROBERT, Y 1995. Affine-by-Statement scheduling of uniform and affine loop nests over parametric domains. J. Parallel Distrib. Comput. 29, 1 (Aug.), 43-59.
    • DARTE, A. AND ROBERT, Y 1995. Affine-by-Statement scheduling of uniform and affine loop nests over parametric domains. J. Parallel Distrib. Comput. 29, 1 (Aug.), 43-59.
  • 15
    • 33746593747 scopus 로고    scopus 로고
    • Simi-automatic composition of loop transformations for deep parallelism and memory hierarchies
    • GIRBAL, S., VASILACHE, N., BASTOUL, C., COHEN, A., PARELLO, D., SIGLER, M., AND TEMAM, O. 2006. Simi-automatic composition of loop transformations for deep parallelism and memory hierarchies. Int. J. Parallel Program. 34, 3, 261-317.
    • (2006) Int. J. Parallel Program , vol.34 , Issue.3 , pp. 261-317
    • GIRBAL, S.1    VASILACHE, N.2    BASTOUL, C.3    COHEN, A.4    PARELLO, D.5    SIGLER, M.6    TEMAM, O.7
  • 20
    • 84888695949 scopus 로고    scopus 로고
    • IMEC
    • IMEC 2006. Atomium website, http://www.imec.be/design/atomium/.
    • (2006) Atomium website
  • 23
    • 84888648885 scopus 로고    scopus 로고
    • KELLY, W. AND PUGH, W. 1993. A framework for unifying reordering transformations. Rep UMIACS-TR-92-126.1, University of Maryland at College Park, Institute for Advanced Computer Studies, Tech. Maryland, USA.
    • KELLY, W. AND PUGH, W. 1993. A framework for unifying reordering transformations. Rep UMIACS-TR-92-126.1, University of Maryland at College Park, Institute for Advanced Computer Studies, Tech. Maryland, USA.
  • 24
    • 1542359434 scopus 로고    scopus 로고
    • KIM, H.S., VLJAYKRISHNAN, N., KANDEMIR, M., BROCKMEYER, E., CATTHOOR, F., AND J. IRWIN, M. 2003. Estimating influence of data layout optimizations on sdRAM energy consumption. In Proceedings of the Interantional Symposium on Low Power Electronics and Design (ISLPED)., 40-43.
    • KIM, H.S., VLJAYKRISHNAN, N., KANDEMIR, M., BROCKMEYER, E., CATTHOOR, F., AND J. IRWIN, M. 2003. Estimating influence of data layout optimizations on sdRAM energy consumption. In Proceedings of the Interantional Symposium on Low Power Electronics and Design (ISLPED)., 40-43.
  • 25
    • 0038105324 scopus 로고    scopus 로고
    • KJELDSBERG, P.G.,CATTHOOR, F., AND AAS, E.J. 2003. Data dependency size estimation for use in memory optimization. IEEE Trans. Comput. Aided Desi. 22, 7 (Jul.), 908-921.
    • KJELDSBERG, P.G.,CATTHOOR, F., AND AAS, E.J. 2003. Data dependency size estimation for use in memory optimization. IEEE Trans. Comput. Aided Desi. 22, 7 (Jul.), 908-921.
  • 27
    • 47649086892 scopus 로고    scopus 로고
    • Dynamic allocation for scratch-pad memory using compile-time decisions
    • NGUYEN, N., DOMINGUEZ, A., AND BARUA, R. 2006. Dynamic allocation for scratch-pad memory using compile-time decisions. ACM Trans. Embedded Comput. Syst. 5, 2, 472-511.
    • (2006) ACM Trans. Embedded Comput. Syst. 5 , vol.2 , pp. 472-511
    • NGUYEN, N.1    DOMINGUEZ, A.2    BARUA, R.3
  • 28
    • 33746967016 scopus 로고    scopus 로고
    • PANDA, P., CATTHOOR, F., DUTT, N.D., DANCKAERT, K., BROCKMEYER, E., KULKARNI, C., VANDER-CAPPELLE, A., AND KJELDSBERG, P.G. 2001. Data and memory optimization techniques for embedded systems. ACM Trans. Des. Autom. Electron. Syst. 6, 2 (Apr.), 149-206.
    • PANDA, P., CATTHOOR, F., DUTT, N.D., DANCKAERT, K., BROCKMEYER, E., KULKARNI, C., VANDER-CAPPELLE, A., AND KJELDSBERG, P.G. 2001. Data and memory optimization techniques for embedded systems. ACM Trans. Des. Autom. Electron. Syst. 6, 2 (Apr.), 149-206.
  • 30
    • 4644222025 scopus 로고    scopus 로고
    • Improving data locality by array contraction
    • SONG, Y., XU, R., WANG, C., AND LI, Z. 2004. Improving data locality by array contraction. IEEE Trans. Comput. 53, 9, 1073-1084.
    • (2004) IEEE Trans. Comput , vol.53 , Issue.9 , pp. 1073-1084
    • SONG, Y.1    XU, R.2    WANG, C.3    LI, Z.4
  • 33
    • 84863557512 scopus 로고    scopus 로고
    • VAN ACHTEREN, T., DECONINCK, G., CATTHOOR, F., AND LAUWEREINS, R. 2002. Data reuse exploration techniques for loop-dominated application. In Proceedings of the 5th ACM / IEEE Design and Test in Europe Conference (Paris), 428-535.
    • VAN ACHTEREN, T., DECONINCK, G., CATTHOOR, F., AND LAUWEREINS, R. 2002. Data reuse exploration techniques for loop-dominated application. In Proceedings of the 5th ACM / IEEE Design and Test in Europe Conference (Paris), 428-535.
  • 37
    • 84888747760 scopus 로고    scopus 로고
    • WILDE, D.K. 1993. Alibrary for doingpolyhedral operations. M.S. thesis, Oregon State University, Corvallis, Orgon also Tech. Repo. PI-785, IRISA, Rennes, France.
    • WILDE, D.K. 1993. Alibrary for doingpolyhedral operations. M.S. thesis, Oregon State University, Corvallis, Orgon also Tech. Repo. PI-785, IRISA, Rennes, France.
  • 38
    • 0026232450 scopus 로고    scopus 로고
    • WOLF, M.E. AND LAM, M.S. 1991. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Syst. 2, 4 (Oct.), 452-471.
    • WOLF, M.E. AND LAM, M.S. 1991. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Syst. 2, 4 (Oct.), 452-471.
  • 39
    • 0032303141 scopus 로고    scopus 로고
    • WUYTACK, S., DLGUET, J.P., CATTHOOR, F., AND DE MAN, H. 1998. Formalized methodology for data reuse exploration for low-power hierarchical memory mappings. IEEE Trans. VLSI Syst. 6, 4 (Dec.), 529-537.
    • WUYTACK, S., DLGUET, J.P., CATTHOOR, F., AND DE MAN, H. 1998. Formalized methodology for data reuse exploration for low-power hierarchical memory mappings. IEEE Trans. VLSI Syst. 6, 4 (Dec.), 529-537.


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