• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.361-371
• /
• 2008

In this paper, the hypercube, hyperpetersen networks, whose degree is increasing in accordance with expansion of number of node and complete binary tree are one-to-one embedded into peterson-torus(PT) network which has fixed degree. The one-to-one embedding has less risk of overload or idle for the processor comparative to one-to-many and many-to-one embedding. For the algorithms which were developed on hypercube or hyperpetersen are used for PT network, it is one-to one embedded at expansion ${\doteqdot}1$, dilation 1.5n+2 and link congestion O(n) not to generate large numbers of idle processor. The complete binary tree is embedded into PT network with link congestion =1, expansion ${\doteqdot}5$ and dilation O(n) to avoid the bottleneck at the wormhole routing system which is not affected by the path length.