{"title":"为片上网络生成避免冲突的自定义拓扑","authors":"S. Deniziak, R. Tomaszewski","doi":"10.1109/DDECS.2009.5012136","DOIUrl":null,"url":null,"abstract":"In this paper we present a methodology for custom topology generation, offering low latency and significantly reduced power consumption. The novelty of our approach lies in the objective - we focus on complete elimination of the contention on the links. It is achieved through alternate path generation, insertion of additional links and message scheduling. We also present a novel concept of Message Dependence Graph for traffic analysis. The methodology operates under application and design constraints, producing network topology along with routing paths. Experimental results confirming benefits of the proposed approach are provided.","PeriodicalId":6325,"journal":{"name":"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems","volume":"22 1","pages":"234-237"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Contention-avoiding custom topology generation for network-on-chip\",\"authors\":\"S. Deniziak, R. Tomaszewski\",\"doi\":\"10.1109/DDECS.2009.5012136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a methodology for custom topology generation, offering low latency and significantly reduced power consumption. The novelty of our approach lies in the objective - we focus on complete elimination of the contention on the links. It is achieved through alternate path generation, insertion of additional links and message scheduling. We also present a novel concept of Message Dependence Graph for traffic analysis. The methodology operates under application and design constraints, producing network topology along with routing paths. Experimental results confirming benefits of the proposed approach are provided.\",\"PeriodicalId\":6325,\"journal\":{\"name\":\"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems\",\"volume\":\"22 1\",\"pages\":\"234-237\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DDECS.2009.5012136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DDECS.2009.5012136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Contention-avoiding custom topology generation for network-on-chip
In this paper we present a methodology for custom topology generation, offering low latency and significantly reduced power consumption. The novelty of our approach lies in the objective - we focus on complete elimination of the contention on the links. It is achieved through alternate path generation, insertion of additional links and message scheduling. We also present a novel concept of Message Dependence Graph for traffic analysis. The methodology operates under application and design constraints, producing network topology along with routing paths. Experimental results confirming benefits of the proposed approach are provided.