Improving scratchpad allocation with demand-driven data tiling

Embedded Systems Week 2010 - Proceedings of the 2010 International Conference on Compilers, Architecture and Synthesis for Embedded Systems, CASES'10

Volumn , Issue , 2010, Pages 127-136

  Yang, Xuejun ^a   Wang, Li ^a   Xue, Jingling ^b   Tang, Tao ^a   Ren, Xiaoguang ^a   Ye, Sen ^b  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Algorithms; Experimentation; Languages; Performance

Indexed keywords

ALLOCATION ALGORITHM; ALLOCATORS; BASIC IDEA; COMPARABILITY GRAPHS; EXPERIMENTATION; HEAVIEST PATH; INTERFERENCE GRAPHS; LANGUAGES; OFF-CHIP MEMORIES; PERFORMANCE; SCRATCH PAD MEMORY; SCRATCHPAD; TILING ARRAY;

ALGORITHMS; PROGRAM COMPILERS;

EMBEDDED SYSTEMS;

EID: 78650655020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1878921.1878942     Document Type: Conference Paper

References (23)

1. Rajeshwari Banakar, Stefan Steinke, Bo-Sik Lee, M. Balakrishnan, and Peter Marwedel. Scratchpad memory: design alternative for cache on-chip memory in embedded systems. In CODES '02: Proceedings of the tenth international symposium on Hardware/software codesign, pages 73-78. ACM, 2002.
2. Kevin J. Barker, Kei Davis, Adolfy Hoisie, Darren J. Kerbyson, Mike Lang, Scott Pakin, and Jose C. Sancho. Entering the petaflop era: the architecture and performance of roadrunner. In SC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing, pages 1-11. IEEE Press, 2008.
3. G. J. Chaitin. Register allocation & spilling via graph coloring. In SIGPLAN '82: Proceedings of the 1982 135 SIGPLAN symposium on Compiler construction, pages 98-101. ACM Press, 1982.
4. J.d. Cuvillo, W. Zhu, H.u. Ziang, and G.R. Gao. Fast: A functionally accurate simulation toolset for the cyclops64 cellular architecture. In MoBS2005: Workshop on Modeling, Benchmarking, and Simulation, pages 11-20. ACM Press, 2005.
5. William J. Dally, Francois Labonte, Abhishek Das, Patrick Hanrahan, and Jung-Ho Ahn et al. Merrimac: Supercomputing with streams. In SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing, pages 35-42, 2003.
6. Janet Fabri. Automatic storage optimization. SIGPLAN Not., 14(8):83-91, 1979.
7. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). North-Holland Publishing Co., 2004.
8. S. Louis Hakimi, Edward F. Schmeichel, and Neal E. Young. Orienting graphs to optimize reachability. Inf. Process. Lett., 63(5):229-235, 1997.
9. Pinar Heggernes, Federico Mancini, and Charis Papadopoulos. Minimal comparability completions of arbitrary graphs. Discrete Appl. Math., 156(5):705-718, 2008.
10. Qingguang Huang, Jingling Xue, and Xavier Vera. Code tiling for improving the cache performance of pde solvers. In ICPP, pages 615-624, 2003.
11. M. Kandemir, J. Ramanujam, J. Irwin, N. Vijaykrishnan, I. Kadayif, and A. Parikh. Dynamic management of scratch-pad memory space. In DAC '01: Proceedings of the 38th conference on Design automation, pages 690-695, New York, NY, USA, 2001. ACM.
12. Induprakas Kodukula, Nawaaz Ahmed, and Keshav Pingali. Data-centric multi-level blocking. SIGPLAN Not., 32(5):346-357, 1997.
13. Lian Li, Hui Feng, and Jingling Xue. Compiler-directed scratchpad memory management via graph coloring. ACM Trans. Archit. Code Optim., 6(3):1-17, 2009.
14. Lian Li, Lin Gao, and Jingling Xue. Memory coloring: A compiler approach for scratchpad memory management. In PACT '05: Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques, pages 329-338, 2005.
15. Lian Li, Quan Hoang Nguyen, and Jingling Xue. Scratchpad allocation for data aggregates in superperfect graphs. In Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, pages 207-216. ACM, 2007.
16. Lian Li, Hui Wu, Hui Feng, and Jingling Xue. Towards data tiling for whole programs in scratchpad memory allocation. In ACSAC'07: Proceedings of the 12th Asia-Pacific Computer Systems Architecture Conference, pages 63 - 74, 2007.
17. J. Makino, K. Hiraki, and M. Inaba. Grape-dr: 2-pflops massively-parallel computer with 512-core, 512-gflops processor chips for scientific computing. In SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, pages 1-11. ACM, 2007.
18. Jinpyo Park and Soo-Mook Moon. Optimistic register coalescing. ACM Trans. Program. Lang. Syst., 26(4):735-765, 2004.
19. Sumesh Udayakumaran and Rajeev Barua. Compiler-decided dynamic memory allocation for scratch-pad based embedded systems. In CASES '03: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems, pages 276-286, New York, NY, USA, 2003. ACM.
20. Sumesh Udayakumaran, Angel Dominguez, and Rajeev Barua. Dynamic allocation for scratch-pad memory using compile-time decisions. ACM Trans. Embed. Comput. Syst., 5(2):472-511, 2006.
21. Manish Verma, Lars Wehmeyer, and Peter Marwedel. Dynamic overlay of scratchpad memory for energy minimization. In CODES+ISSS '04: Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, pages 104-109. ACM, 2004.
22. Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, and Ying Zhang. Comparability graph coloring for optimizing utilization of stream register files in stream processors. In PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 111-120, 2009.
23. Chunhui Zhang and Fadi Kurdahi. On combining iteration space tiling with data space tiling for scratch-pad memory systems. In ASP-DAC '05: Proceedings of the 2005 Asia and South Pacific Design Automation Conference, pages 973-976. ACM, 2005.