Sciweavers

Share
ISCAPDCS
2004

The Fat-Stack and Universal Routing in Interconnection Networks

11 years 2 months ago
The Fat-Stack and Universal Routing in Interconnection Networks
This paper shows that a novel network called the fat-stack is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers. The fat-stack resembles the fattree and the fat-pyramid in hardware structure, but it has its unique strengths. It is a construct of an atomic subnetwork unit consisting of one ring and one or more upward links to its upper subnetwork. This simple structure entails easy wirability. The network also uses less wires. More importantly, it has the capability to scale up to represent a large-scale distributed network. Our routing analysis shows that the fat-stack incurs certain unsurmountable delay when wires have uniform unit capacity assignment. But doubling capacity up the network forms a universal network. Our universality proof shows that a fat-stack variant with increased links and of area (A) can simulate any competing network of area A with O(log A) overhead independent of wir...
Kevin F. Chen, Edwin Hsing-Mean Sha
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where ISCAPDCS
Authors Kevin F. Chen, Edwin Hsing-Mean Sha
Comments (0)
books