{"title":"规则的d邻居拓扑","authors":"R. Trobec, Uros Jovanovic","doi":"10.1109/EMPDP.2001.905004","DOIUrl":null,"url":null,"abstract":"Topological parameters and routing performances of regular d-neighbours topologies are analysed and discussed in this paper. Average and maximal distances between nodes are compared for hypercubes, 3D-tori, arrangement graphs and recently introduced d-meshes, an extended family of two-dimensional regular meshes of an arbitrary degree d and an isomorphic node neighbourhood. d-meshes are superior in node-to-node distances, in the expansion scalability and in the potential for a planar implementation.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Regular d-neighbours topologies\",\"authors\":\"R. Trobec, Uros Jovanovic\",\"doi\":\"10.1109/EMPDP.2001.905004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Topological parameters and routing performances of regular d-neighbours topologies are analysed and discussed in this paper. Average and maximal distances between nodes are compared for hypercubes, 3D-tori, arrangement graphs and recently introduced d-meshes, an extended family of two-dimensional regular meshes of an arbitrary degree d and an isomorphic node neighbourhood. d-meshes are superior in node-to-node distances, in the expansion scalability and in the potential for a planar implementation.\",\"PeriodicalId\":262971,\"journal\":{\"name\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMPDP.2001.905004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.905004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Topological parameters and routing performances of regular d-neighbours topologies are analysed and discussed in this paper. Average and maximal distances between nodes are compared for hypercubes, 3D-tori, arrangement graphs and recently introduced d-meshes, an extended family of two-dimensional regular meshes of an arbitrary degree d and an isomorphic node neighbourhood. d-meshes are superior in node-to-node distances, in the expansion scalability and in the potential for a planar implementation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
