Name
Abstract | ||
|---|---|---|
Properties that make the binary cube an attractive interconnection network for many-processor machines include expansibility, a simple routing-algorithm, and a diameter that grows logarithmically with the number of processors. In this paper we introduce an operation called twist that diverts two edges. By applying a twist to a number of judiciously chosen edges a cube is transformed into a so-called twisted cube. We show that the twisted cube has a diameter which is roughly half the diameter of the original cube, that a routing algorithm exists, albeit a more complex one, and that expansibility is retained. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/3-540-17943-7_126 | PARLE (1) |
Keywords | Field | DocType |
twisted cube | Twist,Discrete mathematics,Link-state routing protocol,Twisted cube,Computer science,Interconnection,Binary number,Cube,Routing algorithm | Conference |
Volume | ISSN | ISBN |
258 | 0302-9743 | 0-387-17943-7 |
Citations | PageRank | References |
87 | 5.70 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P A J Hilbers | 1 | 117 | 10.52 |
| M R J Koopman | 2 | 87 | 5.70 |
| J L A van de Snepscheut | 3 | 87 | 6.04 |