| 英文摘要 |
In this paper, we present that a tree machine can be embedded into incomplete hypercube with expansion 1, load 1, dilation 2 and congestion 2. This result is better than the expansion (2h+1+2h)/(2h+1+2h-2) in [14]. Then we consider how to embed a large tree machine into a hypercube for considering load-balance. We have shown that a tree machine TMh (h³1) can be embedded into a hypercube Hh+1 with dilation 1, congestion 2 and load 2, and a tree machine TMh can be embedded into Hn (h³n³1) with dilaton 1, congestion 3 and load 2h-n+1+2h-n. The load of these embeddings is well balanced. |