P. Gutberlet, Jens Müller, Heinrich Krämer, W. Rosenstiel
{"title":"Automatic module allocation in high level synthesis","authors":"P. Gutberlet, Jens Müller, Heinrich Krämer, W. Rosenstiel","doi":"10.1109/EURDAC.1992.246223","DOIUrl":null,"url":null,"abstract":"A main step in high-level synthesis is data-path synthesis consisting of allocation, scheduling and assignment. The authors present an allocation algorithm designed for an environment where the allocation precedes scheduling and assignment. This algorithm selects the hardware components (in type and number) fully automatically and supports a realistic area/time tradeoff. During this allocation a design space exploration is performed. The allocation is separated from the scheduling and assignment, allowing very efficient implementation.<<ETX>>","PeriodicalId":218056,"journal":{"name":"Proceedings EURO-DAC '92: European Design Automation Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings EURO-DAC '92: European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1992.246223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
A main step in high-level synthesis is data-path synthesis consisting of allocation, scheduling and assignment. The authors present an allocation algorithm designed for an environment where the allocation precedes scheduling and assignment. This algorithm selects the hardware components (in type and number) fully automatically and supports a realistic area/time tradeoff. During this allocation a design space exploration is performed. The allocation is separated from the scheduling and assignment, allowing very efficient implementation.<>