Memory layout techniques for variables utilizing efficient DRAM access modes in embedded system design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 24, Issue 2, 2005, Pages 278-287

  Choi, Yoonseo ^a   Kim, Taewhan ^b   Han, Hwansoo ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

DRAM access modes; Embedded systems; Storage assignment

Indexed keywords

ALGORITHMS; BANDWIDTH; CODES (SYMBOLS); COMPUTER AIDED DESIGN; EMBEDDED SYSTEMS; HEURISTIC PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; LOGIC DESIGN; MULTIMEDIA SYSTEMS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

DRAM ACCESS MODES; MEMORY BANDWIDTH; SOFTWARE COMPILATION; STORAGE ASSIGNMENT;

DYNAMIC RANDOM ACCESS STORAGE;

EID: 13144250214     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.837721     Document Type: Article

References (29)

1. P. R. Panda, N. D. Dutt, and A. Nicolau, "Exploiting off-chip memory access modes in high-level synthesis," in Proc. Int. Conf. Computer-Aided Design, 1997, pp. 333-340.
2. _, "Memory data organization for improved cache performance in embedded processor applications," ACM Trans. Design Automation Electron. Syst., vol. 2, no. 4, pp. 384-409, 1997.
3. N. D. Dutt, "Memory organization and exploration for embedded systems-on-silicon," presented at the Int. Conf. VLSI Computer-Aided Design, Seoul, Korea, 1997.
4. T. C. Mowry, M. S. Lam, and A. Gupta, "Design and evaluation of a compiler algorithm for prefetching," Architec. Support Program. Lang. Oper. Syst., vol. 27, no. 9, pp. 62-73, 1992.
5. M. S. Lam, "Software pipelining: An effective scheduling technique for VLIW machines," in Proc. SIGPLAN 88 Conf. Program. Lang. Design Implement., vol. 23, 1998, pp. 318-328.
6. A. W. Appel, Modern Compiler Implementation in C, MA: Cambridge, 1998, ch. 21, pp. 502-509.
7. S. Wuytack, F. Catthoor, G. de Jong, B. Lin, and H. De Man, "Flow graph balancing for minimizing the required memory bandwidth," in Proc. Int. Symp. Syst. Synthesis, 1996, pp. 127-132.
8. F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle, Custom Memory Management Methodology. Norwell, MA: Kluwer, 1998.
9. IBM Cu-11 Embedded DRAM Macro (2002). [Online]. Available: http://www-3.ibm.com/chips/techlib/techlib.nsf/techdocs/ 4CBB96F927E2D6D287256B98004E1D98/$file/Cu11_embedded_DRAM.10.pdf
10. CS70DL Embedded DRAM (1999). [Online], Available: http://www.fme.fujitsu. com/products/asic/pdf/CS70DLFS.pdf
11. A. Khare, P. R. Panda, N. D. Dutt, and A. Nicolau, "High-level synthesis with synchronous and RAMBUS DRAMs," in Workshop Synthesis Syst. Integr, Mixed Technol., 1998.
12. P. Grun, N. D. Dutt, and A. Nicolau, "Memory aware compilation through accurate timing extraction," in Proc. Design Automation Conf., 2000, pp. 316-321.
13. _, "APEX: Access pattern based memory architecture exploration," in Proc. Int. Symp. Syst. Synthesis, 2001, pp. 25-32.
14. K. Ayukawa, T. Watanabe, and S. Narita, "An access-sequence control scheme to enhance random-access per formance of embedded DRAMs," IEEE J. Solid-State Circuits, vol. 33, no. 5, pp. 800-806, May 1998.
15. S. A. Mckee, W. A. Wulf, J. H. Aylor, R. H. Klenke, M. H. Salinas, S. I. Hong, and D. Weikle, "Dynamic access ordering for streamed computations," IEEE Trans. Comput., vol. 49, no. 11, pp. 1255-1271, Nov. 2000.
16. J. Chame, J. Shin, and M. Hall, "Compiler transformations for exploiting bandwidth in PIM-based systems," presented at the 27th Annu. Int. Symp. Comput. Architecture, Workshop Solving Memory Wall Problem, Vancouver, BC, Canada, 2000.
17. J. Shin, J. Chame, and M. Hall, "A compiler algorithm for exploiting page-mode memory access in embedded-DRAM devices," presented at the 4th Workshop Media Streaming Process., Istanbul, Turkey, 2002.
18. S. Hettiaratchi, P. Cheung, and T. Clarke, "Energy efficient address assignment through minimized memory row switching," in Proc. Int. Conf. Computer-Aided Design, 2002, pp. 577-582.
19. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. New York: Freeman, 1979, p. 209.
20. D. B. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice-Hall, 1996, pp. 85-91.
21. Burst/Page Mode Family (2002). [Online]. Available: http://www.amd.com/ us-en/FlashMemory/ProductInformation/0,37_1447_1451,00.html
22. M. T.-C. Lee, V. Tiwari, S. Malik, and M. Fujita, "Power analysis and minimization techniques for embedded DSP software," IEEE Trans. VLSI Syst., vol. 5, no. 1, pp. 123-135, Jan. 1997.
23. V. Zivojnovic, J. Velarde, and C. Schlager, "Dspstone: A DSP-oriented benchmarking methodology," in Proc. Int. Conf. Signal Process. Applicat. Technol., 1994, pp. 715-720.
24. Benchmark Archives at CBL [Online]. Available: http://www.cbl.ncsu.edu/ CBL_Docs/Bench.html
25. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C: The Art of Scientific Computing. Cambridge, UK: Cambridge Univ. Press, 1993, pp. 154, 152-155.
26. S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang, "Storage assignment to decrease code size," ACM Trans. Program. Lang. Syst., vol. 18, no. 3, pp. 235-253, 1996.
27. C. Lee, M. Potkonjak, and W. H. Mangione-Smith, "Mediabench: A tool for evaluating and synthesizing multimedia and communications systems," in Proc. Int. Symp. Microarchitec., 1997, pp. 330-335.
28. M. F. Jacome, G. De Veciana, and V. Lapinskii, "Exploring performance tradeoffs for clustered ASIPs," in Proc. Int. Conf. Computer-Aided Design, 2000, pp. 504-510.
29. S. Rixner, W. J. Dally, B. Khailany, P. Mattson, U. J. Kapasi, and J. D. Owens, "Register organization for media processing," in Proc. Int. Symp. High-Performance Comput. Architec., 2000, pp. 375-386.