Qinghua Wu, Leibo Liu, S. Yin, Yu Ren, Shaojun Wei
{"title":"SPC: An Approach to Guarantee Performance in Cost Oriented Mapping Algorithm for NoC Architectures","authors":"Qinghua Wu, Leibo Liu, S. Yin, Yu Ren, Shaojun Wei","doi":"10.1109/NAS.2013.30","DOIUrl":null,"url":null,"abstract":"How to map IP cores onto NoC architectures is a significant issue (application mapping) in multi-core system design. Many mapping algorithms which aim at optimizing cost metrics(e.g. energy consumption) in the mapping procedure are proposed. Some of those algorithms consider satisfying performance metrics (e.g. latency) constraints. This paper analyses the mechanism leading to performance decreases and furthermore proposes a new approach SPC (satisfy processing capacity) to guarantee performance metrics for cost oriented application mapping algorithms. Using this approach in one of those algorithms, performance metrics constraints are well ensured and cost metrics are hardly affected. In fact, one random experiment shows that performance is enhanced at most 10% even if cost is reduced by 6%.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2013.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
How to map IP cores onto NoC architectures is a significant issue (application mapping) in multi-core system design. Many mapping algorithms which aim at optimizing cost metrics(e.g. energy consumption) in the mapping procedure are proposed. Some of those algorithms consider satisfying performance metrics (e.g. latency) constraints. This paper analyses the mechanism leading to performance decreases and furthermore proposes a new approach SPC (satisfy processing capacity) to guarantee performance metrics for cost oriented application mapping algorithms. Using this approach in one of those algorithms, performance metrics constraints are well ensured and cost metrics are hardly affected. In fact, one random experiment shows that performance is enhanced at most 10% even if cost is reduced by 6%.