{"title":"Scheduled Routing in an Optical Hypercube","authors":"Risto T. Honkanen","doi":"10.1109/ISPDC.2008.16","DOIUrl":null,"url":null,"abstract":"In this work we present an all-optical hypercube architecture and a systolic routing protocol for it. An r-dimensional optical hypercube network (OHC) consists of N = 2r processing nodes and r2r optical links. We study a systolic routing protocol that is based on cyclic changes of states of routers and scheduled sendings of packets. The protocol ensures that no electro-optical conversions are needed in the intermediate routing nodes and all the packets injected into the routing machinery reach their targets without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h in omega(NlogN).","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2008.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this work we present an all-optical hypercube architecture and a systolic routing protocol for it. An r-dimensional optical hypercube network (OHC) consists of N = 2r processing nodes and r2r optical links. We study a systolic routing protocol that is based on cyclic changes of states of routers and scheduled sendings of packets. The protocol ensures that no electro-optical conversions are needed in the intermediate routing nodes and all the packets injected into the routing machinery reach their targets without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h in omega(NlogN).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
