{"title":"具有距离不敏感路由的树的全端口网格的最优广播","authors":"Petr Salinger, P. Tvrdík","doi":"10.1109/IPDPS.2000.846005","DOIUrl":null,"url":null,"abstract":"The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal broadcasting in all-port meshes of trees with distance-insensitive routing\",\"authors\":\"Petr Salinger, P. Tvrdík\",\"doi\":\"10.1109/IPDPS.2000.846005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.\",\"PeriodicalId\":206541,\"journal\":{\"name\":\"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPS.2000.846005\",\"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 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2000.846005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal broadcasting in all-port meshes of trees with distance-insensitive routing
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
