{"title":"Efficient Hardware/Software Partitioning Approach for Embedded Multiprocessor Systems","authors":"Tzong-Yen Lin, Yu-Ting Hung, Rong-Guey Chang","doi":"10.1109/VDAT.2006.258167","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient hardware/software partitioning approach that target at embedded multiprocessor systems with time, area, and power constraints. Our approach is performed in two phases. In the partitioning phase, for an embedded system with p software components and q hardware components, recursive spectral bisection (RSB) has been used to partition an application program into n well-balanced and connected blocks with low communication cost. These blocks are mapped into software components and then tasks in software components will be moved to hardware components to meet the deadline constraint. In the scheduling phase, we derive an approach to reduce the system cost in connection with power and hardware area by exchanging tasks between software and hardware components. Experimental results show that our approach is effective for embedded multiprocessor systems","PeriodicalId":356198,"journal":{"name":"2006 International Symposium on VLSI Design, Automation and Test","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on VLSI Design, Automation and Test","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VDAT.2006.258167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
Abstract
This paper presents an efficient hardware/software partitioning approach that target at embedded multiprocessor systems with time, area, and power constraints. Our approach is performed in two phases. In the partitioning phase, for an embedded system with p software components and q hardware components, recursive spectral bisection (RSB) has been used to partition an application program into n well-balanced and connected blocks with low communication cost. These blocks are mapped into software components and then tasks in software components will be moved to hardware components to meet the deadline constraint. In the scheduling phase, we derive an approach to reduce the system cost in connection with power and hardware area by exchanging tasks between software and hardware components. Experimental results show that our approach is effective for embedded multiprocessor systems