Lesson23Topology

IntrotoNetworkModels:LinksandDiameter

NetworkTypes:
1DLinear
2DMesh
FullyConnected=everynodehasadirectconnecttoeveryothernode.

Links :numberofconnections(Links).
LinearNetwork:P1links
MeshNetwork:2Plinks
FullyConnectedNetwork:P(P1)/2links P2/2

Thenumberoflinksisimportantbecauseitisaproxyforcostthemorelinksthehigherthe
price.

Diameter:thelongestshortestpath.Takeallpairsofnodesandcomputetheshortestpath,
thentakethelongestofthesepaths.

LinearNetwork:P1diameter
MeshNetwork: 2P 1 diameter
FullyConnectedNetwork:1diameter

ImprovetheDiameterofaLinearNetwork

DiameterofaRingnetworkis: f loor (P/2)

ImprovetheDiameterofa2DMesh

Anythingmethodthatconnectsthecornerswillcutthediameterinhalf.
WrappingtherowsandcolumnsleadstoaTorusnetwork.

Bisection(Band)Width

BisectionWidth=theminimumnumberoflinksthathavetoberemovedtocutthenetwork
intotwoequalgroupsofnodes.
LinearNetwork:bisectionwidth=1
RingNetwork:bisectionwidth=2
2DMeshNetwork:bisectionwidth= P wherePisthenumberofnodes

FullyConnectedNetwork:P2/4

Bandwidth:ifequallinkspeed( )then: 2D(P ) = 2D(P ) *

ImprovetheBisectionofa2DMesh

Whereshouldlinksbeaddedtodoublethebisectionwidthofa2DMeshnetwork?
Wraparoundlinkswilldoublethebisectionwidth.

SomeOtherNetworkTopologies

Othertopologies:
Tree:
Links:Plinks
Diameter:logPlinks
Bisection:1

Thisisaterriblebisectionwidth.Sodesignersaddmanymorewiresnearthetopof
thetree.

DdimensionalMeshorTorus:

Ifithasdroot(P)nodesperdimension
Links:dP
Diameter:d(P)1/d
Bisection:2(P)(d1)/d

Ddimensionalmeshesandtoriareveryimportant,manyoftheworlds
supercomputersuselowdimensionalmeshes.

HyperCubes:arelog(P)dimensionaltorus
Links:P*log(P)
Diameter:log(P)
Bisection:P/2

Hypercubeshaveahighcostofwiresbuttheyalsohaveahighbisectionwidth.

TypeNetwork

Links

Diameter

Bisection

(small=good)

(large=good)

Linear

P1

P1

Mesh

2P

2P 1

FullyConnected

P2/2

Tree

log(P)

DDimensionalMesh dP

d(P)1/d

2(P)(d1)/d

HyperCube

log(P)

P/2

P*log(P)

MappingsandCongestion

Mappings:runningthelogicalnetworkonanactualphysicalnetwork.

Forexample:Analgorithmisdesignedforaringnetwork,buttheunderlyingphysicalnetwork
isa2Dtorus.Thereshouldbelittletonocongestion.

Ifthealgorithmisdesignedfora2Dtorusnetwork,buttheunderlyingphsyicalnetworkisa
ring,therewillbealotofcongestion.

Congestion=maximumnumberoflogicaledgesthatmaptoaphysicaledge.

Congestionofaringgoingtoatorus=1
Congestionofatorusgoingtoaring=>6

LowerBoundonCongestion

Bxphysicalbisectionwidth
Llogicaledgescut

C L/Bx andL BL

So.C L/Bx BL/Bx

Ifyouknowthecongestion.youllknowhowmuchworsethecostofyouralgorithmwillbeon
aphysicalnetworkwithalowerbisectioncapacity.

ExploitingHigherDeimensions

Exploittheextracapacityofanetworkthathasextralinks.