{"title":"Design space exploration for streaming applications on multiprocessors with guaranteed service NoC","authors":"U. Mirza, F. Gruian, K. Kuchcinski","doi":"10.1145/2536522.2536527","DOIUrl":null,"url":null,"abstract":"This paper addresses design space exploration for streaming applications (such as MPEG) running on multi-processor platforms with guaranteed service interconnects. In particular, we solve mapping, path selection and router configuration problems. Given the complexity of these problems, state of the art approaches in this area largely rely on greedy heuristics, which do not guarantee optimality. Our approach is based on a constraint programming formulation that combines a number of steps, sequential in classical approaches. Thus, our method has the potential of finding optimal solutions with respect to resource usage under processing and bandwidth constraints. The experimental evaluation shows that our approach is capable of exploring a range of solutions while giving the designer the opportunity to emphasize the importance of various design metrics.","PeriodicalId":344147,"journal":{"name":"Network on Chip Architectures","volume":"15 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Network on Chip Architectures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2536522.2536527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
This paper addresses design space exploration for streaming applications (such as MPEG) running on multi-processor platforms with guaranteed service interconnects. In particular, we solve mapping, path selection and router configuration problems. Given the complexity of these problems, state of the art approaches in this area largely rely on greedy heuristics, which do not guarantee optimality. Our approach is based on a constraint programming formulation that combines a number of steps, sequential in classical approaches. Thus, our method has the potential of finding optimal solutions with respect to resource usage under processing and bandwidth constraints. The experimental evaluation shows that our approach is capable of exploring a range of solutions while giving the designer the opportunity to emphasize the importance of various design metrics.