Performance Analysis of k-Ary n-Cube Interconnection Networks Export

@article{citeulike:2682231, abstract = {This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection are derived that agree closely with experi- mental measurements. It is shown that low-dimensional networks (e.g., tort) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width}, author = {Dally, William J.}, citeulike-article-id = {2682231}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8474}, journal = {IEEE Transactions on Computers}, keywords = {cs533}, number = {6}, pages = {775--785}, posted-at = {2008-04-17 15:43:11}, priority = {2}, title = {Performance Analysis of k-Ary n-Cube Interconnection Networks}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8474}, volume = {39}, year = {1990} }

TY - JOUR ID - citeulike:2682231 L3 - citeulike-article-id:2682231 N2 - This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection are derived that agree closely with experi- mental measurements. It is shown that low-dimensional networks (e.g., tort) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width IS - 6 JF - IEEE Transactions on Computers EP - 785 TI - Performance Analysis of k-Ary n-Cube Interconnection Networks VL - 39 SP - 775 KW - cs533 AU - Dally, William PY - 1990/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8474 ER -