K. Manna, P. Khaitan, S. Chattopadhyay, I. Sengupta
{"title":"Particle Swarm Optimization based technique for Network-on-Chip testing","authors":"K. Manna, P. Khaitan, S. Chattopadhyay, I. Sengupta","doi":"10.1109/EAIT.2012.6407863","DOIUrl":null,"url":null,"abstract":"Network-on-Chip (NoC) has emerged as a viable solution for the modern SoC design. It has guaranteed the reusability, scalability and parallelism in communication. Reuse of NoC as a test access mechanism reduces the testing cost. In this paper we present a Particle Swarm Optimization based technique to solve the test scheduling problem of NoC. In this method we have considered deterministic routing to establish the path for each core. Experimental results show that our approach requires less test time compared to other heuristics.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Emerging Applications of Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EAIT.2012.6407863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Network-on-Chip (NoC) has emerged as a viable solution for the modern SoC design. It has guaranteed the reusability, scalability and parallelism in communication. Reuse of NoC as a test access mechanism reduces the testing cost. In this paper we present a Particle Swarm Optimization based technique to solve the test scheduling problem of NoC. In this method we have considered deterministic routing to establish the path for each core. Experimental results show that our approach requires less test time compared to other heuristics.