Gwenolé Corre
ABSTRACT
We introduce a new approach to take into account the memory architecture and the memory mapping in behavioral synthesis. We formalize the memory mapping as a set of constraints for the synthesis, and defined a Memory Constraint Graph and an accessibility criterion to be used in the scheduling step. We present a new strategy for implementing signals (ageing vectors). We formalize the maturing process and explain how it may generate memory conflicts over several iterations of the algorithm. The final Compatibility Graph indicates the set of valid mappings for every signal. Several experiments are performed with our HLS tool GAUT. Our scheduling algorithm exhibits a relatively low complexity that permits to tackle complex designs in a reasonable time.
- HLSynth'92 benchmark information. http://www.cbl.ncsu.edu/CBL_Docs/hls92.html]]Google Scholar
- ITRS homepage. http://public.itrs.net/]]Google Scholar
- F. Catthoor, K. Danckaert, C. Kulkarni, and T. Omnès. Data Transfer and Storage (DTS) architecture issues and exploration in multimedia processors. Marcel Dekker Inc., NewYork, 2000.]]Google Scholar
- P. Ellervee. High-Level Synthesis of Control and Memory Intensive Applications. PhD thesis, Royal Institut of Technology, Jan. 2000.]]Google Scholar
- D. Knapp, T. Lyand, et al. Behavioral synthesis methodology for HDL-based specification and validation. In Proc. Design Automation Conference DAC'95, June 1995.]] Google ScholarDigital Library
- H. Ly, D. Knapp, R. Miller, and D. McMillen. Scheduling using behavioral templates. In Proc. Design Automation Conference DAC'95, pages 101--106, June 1995.]] Google ScholarDigital Library
- A. Nicolau and S. Novack. Trailblazing a hierarchical approach to percolation scheduling. In Proc. ICPP'93, pages 120--124, 1993.]] Google ScholarDigital Library
- P. Panda et al. Data and memory optimization techniques for embedded systems. Transactions on Design Automation of Electronic Systems, 6(2):149--206, 2001.]] Google ScholarDigital Library
- R. Saied and C. Chakrabarti. Scheduling for minimizing the number of memory accesses in low power applications. In Proc. VLSI Signal Processing, pages 169--178, Oct. 1996.]]Google ScholarCross Ref
- J. Seo, T. Kim, and P. Panda. An integrated algorithm for memory allocation and assignment in high-level synthesis. In Proc. Design Automation Conference DAC'01, pages 608--611, June 2001.]] Google ScholarDigital Library
Index Terms
- Memory accesses management during high level synthesis
Recommendations
Memory Accesses Management During High Level Synthesis
CODES+ISSS '04: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004We introduce a new approach to take into account the memory architecture and the memory mapping in behavioral synthesis. We formalize the memory mapping as a set of constraints for the synthesis, and defined a Memory Constraint Graph and an ...
A memory aware behavioral synthesis tool for real-time VLSI circuits
GLSVLSI '04: Proceedings of the 14th ACM Great Lakes symposium on VLSIWe introduce a new approach to take into account the memory architecture and the memory mapping in the Behavioral Synthesis of Real-Time VLSI circuits. We formalize the memory mapping as a set of constraints for the thesis, and defined a Memory ...
High-Level Synthesis: Past, Present, and Future
Editor's note:This article presents the history and evolution of HLS from research to industry adoption. The authors offer insights on why earlier attempts to gain industry adoption were not successful, why current HLS tools are finally seeing adoption, ...
Comments