Show simple item record

dc.contributor.authorDeHon, Andreen_US
dc.date.accessioned2004-10-20T20:22:45Z
dc.date.available2004-10-20T20:22:45Z
dc.date.issued1990-02-01en_US
dc.identifier.otherAITR-1224en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/7026
dc.description.abstractThe Transit network provides high-speed, low-latency, fault-tolerant interconnect for high-performance, multiprocessor computers. The basic connection scheme for Transit uses bidelta style, multistage networks to support up to 256 processors. Scaling to larger machines by simply extending the bidelta network topology will result in a uniform degradation of network latency between all processors. By employing a fat-tree network structure in larger systems, the network provides locality and universality properties which can help minimize the impact of scaling on network latency. This report details the topology and construction issues associated with integrating Transit routing technology into fat-tree interconnect topologies.en_US
dc.format.extent4074548 bytes
dc.format.extent3944868 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAITR-1224en_US
dc.titleFat-Tree Routing for Transiten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record