Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Technical Reports (1964 - 2004)
  5. Fat-Tree Routing for Transit

Fat-Tree Routing for Transit

Thumbnail Image
Download
Name

AITR-1224.pdf

Size

3.76 MB

Format

Adobe PDF

Checksum (MD5)

1043a0ac17a2b0c7fcb258422d1748bb

Thumbnail Image
Download
Name

AITR-1224.ps

Size

3.89 MB

Format

PostScript

Checksum (MD5)

f33f8e1145d631d91164a0fc658b4496

Author(s)
DeHon, Andre
Date Issued
February 1, 1990
Series/Report no.
AITR-1224
Abstract
The 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.
Persistent DSpace Link
http://hdl.handle.net/1721.1/7026
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.