Title of article
A d-move local permutation routing for the d-cube Original Research Article
Author/Authors
Frank K. Hwang، نويسنده , , Y.C. Yao، نويسنده , , Miltos D. Grammatikakis، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
9
From page
199
To page
207
Abstract
Optimal packet routing algorithms for all binary d-cubes of dimension d ⩽ 7 are presented. The algorithms given are synchronous, offer distributed control, and assume d-port, multiaccepting communication. While the previous best known packet routing algorithm [3]on the 7-cube takes 11 time-units, our algorithm has reduced the worst-case time complexity to the minimum possible of 7 units. We also give an optimal routing algorithm for the ternary 4-cube.
Keywords
Packet routing , d-cube , Maximal checking , Local permutation routing , interconnection networks
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884475
Link To Document