{"title":"The New Promising Network-on-Chip Topologies Development Using Product Operation","authors":"E. Rzaev, A. Romanov","doi":"10.1109/RusAutoCon52004.2021.9537317","DOIUrl":null,"url":null,"abstract":"This article analyzes new promising topological solutions for the on-chip communication subsystem for network-on-chip (NoCs). A study of Paley graphs as a subclass of circulant graphs is given. The main parameters (diameter, average path length, graph density, number of edges and degrees of vertices) of modifications of Paley graphs are studied using the direct product of Paley graphs with Paley graphs and ring graph. Other types of products of graphs are considered, namely strong, tensor and lexicographic. Due to the more preferable characteristics, the direct product of the graphs was chosen as the most suitable among the considered ones. A comparative analysis of obtained graphs is provided.","PeriodicalId":106150,"journal":{"name":"2021 International Russian Automation Conference (RusAutoCon)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Russian Automation Conference (RusAutoCon)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RusAutoCon52004.2021.9537317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This article analyzes new promising topological solutions for the on-chip communication subsystem for network-on-chip (NoCs). A study of Paley graphs as a subclass of circulant graphs is given. The main parameters (diameter, average path length, graph density, number of edges and degrees of vertices) of modifications of Paley graphs are studied using the direct product of Paley graphs with Paley graphs and ring graph. Other types of products of graphs are considered, namely strong, tensor and lexicographic. Due to the more preferable characteristics, the direct product of the graphs was chosen as the most suitable among the considered ones. A comparative analysis of obtained graphs is provided.