View in EDS

Memory Allocation and Mapping in High-Level Synthesis—An Integrated Approach.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 11296008
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Memory Allocation and Mapping in High-Level Synthesis—An Integrated Approach.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Jaewon+Seo%2C+Nagarajan%22">Jaewon Seo, Nagarajan</searchLink><relatesTo>1</relatesTo><i> jwseo@vlsisyn.kaist.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Taewhan+Kim%22">Taewhan Kim</searchLink><relatesTo>1</relatesTo><i> tkim@cs.kaist.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Panda%2C+Preeti+Ranjan%22">Panda, Preeti Ranjan</searchLink><relatesTo>2</relatesTo><i> panda@cse.iitd.ernet.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Very+Large+Scale+Integration+%28VLSI%29+Systems%22">IEEE Transactions on Very Large Scale Integration (VLSI) Systems</searchLink>. Oct2003, Vol. 11 Issue 5, p928-938. 11p. 9 Diagrams, 4 Charts, 3 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Integrated+circuits%22">Integrated circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Memory+maps+%28Computer+science%29%22">Memory maps (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=11296008
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TVLSI.2003.817116
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 928
    Subjects:
      – SubjectFull: Integrated circuits
        Type: general
      – SubjectFull: Memory maps (Computer science)
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Memory Allocation and Mapping in High-Level Synthesis—An Integrated Approach.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Jaewon Seo, Nagarajan
      – PersonEntity:
          Name:
            NameFull: Taewhan Kim
      – PersonEntity:
          Name:
            NameFull: Panda, Preeti Ranjan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 10638210
          Numbering:
            – Type: volume
              Value: 11
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
              Type: main
ResultId 1