HYPERCUBE VERSUSTORUS UNDER PIN-OUTCONSTRAINT AND FINITEBUFFERS
Mohamed Ould‐Khaoua · 2007
Previous studies haveshownthat whenthenetwork is subject tothepin-out constraint, thenetwork topology exhibiting thebest performance depends onthenetwork size. Thesestudies haveassumed single flit buffers. Deploying finite size buffers, however, mayaddextra complexity totherouter design andhence will influence thecostandtheperformance ofthenetwork. Thispaper reinvestigates analytically therelative performance merits ofdifferent k-ary n-cube topologies combining wormhole switching, adaptive routing, multiple virtual channels and finite sizebuffers. Theresults reveal new insights demonstrating thesensitivity ofthese studies tothelevel ofdetail andrealism incorporated intheanalysis.