Bibliographic Details
| Title: |
Memory Allocation and Mapping in High-Level Synthesis—An Integrated Approach. |
| Authors: |
Jaewon Seo, Nagarajan1 jwseo@vlsisyn.kaist.ac.kr, Taewhan Kim1 tkim@cs.kaist.ac.kr, Panda, Preeti Ranjan2 panda@cse.iitd.ernet.in |
| Source: |
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. Oct2003, Vol. 11 Issue 5, p928-938. 11p. 9 Diagrams, 4 Charts, 3 Graphs. |
| Subjects: |
Integrated circuits, Memory maps (Computer science), Algorithms |
| Abstract: |
With the increasing design complexity and performance requirement, data arrays in behavioral specification are usually mapped to memories in behavioral synthesis. This paper describes a new algorithm that overcomes two limitations of the previous works on the problem of memory-allocation and array-mapping to memories. Specifically, its key features are a tight link to the scheduling effect, which was totally or partially ignored by the existing memory synthesis systems, and supporting nonuniform access speeds among the ports of memories, which greatly diversify the possible (practical) memory configurations. Experimental data on a set of benchmark filter designs are provided to show the effectiveness of the proposed exploration strategy in finding globally best memory configurations. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Very Large Scale Integration (VLSI) Systems is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
