{"title":"A Reliability-Aware Multi-application Mapping Technique in Networks-on-Chip","authors":"F. Khalili, H. Zarandi","doi":"10.1109/PDP.2013.77","DOIUrl":null,"url":null,"abstract":"This paper proposes a reliability-aware mapping technique for multi applications in networks-on-chip. The proposed technique consists of three main steps: 1) Generating a new core graph enriched by spares, based on a given application core graph, 2) Finding smallest rectangular region to place the given application using a heuristic algorithm, and 3) Searching the specified region into whole NoC, and selecting a region which results minimum overall performance and communication energy. Spare cores are connected to all vertices of application core graph and their edges are weighted by failure probability of processing cores assigned to the application and will be updated during mapping process. Many application core graphs are used to evaluate the proposed technique. The results of 100,000 fault injection experiments show communication energy reduction and performance improvement compared to well-known related techniques in both faulty and fault-free modes.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2013.77","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
This paper proposes a reliability-aware mapping technique for multi applications in networks-on-chip. The proposed technique consists of three main steps: 1) Generating a new core graph enriched by spares, based on a given application core graph, 2) Finding smallest rectangular region to place the given application using a heuristic algorithm, and 3) Searching the specified region into whole NoC, and selecting a region which results minimum overall performance and communication energy. Spare cores are connected to all vertices of application core graph and their edges are weighted by failure probability of processing cores assigned to the application and will be updated during mapping process. Many application core graphs are used to evaluate the proposed technique. The results of 100,000 fault injection experiments show communication energy reduction and performance improvement compared to well-known related techniques in both faulty and fault-free modes.