Nearly optimal three dimensional layout of hypercube networks
被引:0
作者:
Calamoneri, T
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma La Sapienza, Dept Comp Sci, I-00198 Rome, ItalyUniv Roma La Sapienza, Dept Comp Sci, I-00198 Rome, Italy
Calamoneri, T
[1
]
Massini, A
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma La Sapienza, Dept Comp Sci, I-00198 Rome, ItalyUniv Roma La Sapienza, Dept Comp Sci, I-00198 Rome, Italy
Massini, A
[1
]
机构:
[1] Univ Roma La Sapienza, Dept Comp Sci, I-00198 Rome, Italy
来源:
GRAPH DRAWING
|
2004年
/
2912卷
关键词:
hypercube network;
three dimensional layout;
VLSI layout volume;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the layout volume of the hypercube network.