An Analytical Model for Wormhole Routing with Finite Size Input Bu ers
An Analytical Model for Wormhole Routing with Finite Size Input Bu ers
An Analytical Model for Wormhole Routing with Finite Size Input Bu ers
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
[5]C.Seitzetal.\TheHypercubeCommunicationsChip".Technicalreport,Dep. [3]et.alL.Kleinrock.\TheSupercomputerSupernet:AScalableDistributedTerabitNetwork".JournalofHighSpeedNetworks:specialissueonOpticalNetworks,<br />
[6]L.M.NiandP.K.McKinley.\ASurveyof<strong>Wormhole</strong><strong>Routing</strong>TechniquesinDirect [4]P.KermaniandL.Kleinrock.\Virtualcut-through:ANewComputerCommunicationSwitchingTechnique".ComputerNetworks,3:267{289,1979.<br />
ComputerScience,Cali<strong>for</strong>niaInst.,March1985.DisplayFile5128:DF:85. Networks".Computer,pages62{76,February1993. 4(4):407{24,1995.<br />
[7]W.J.Dally.\Per<strong>for</strong>mance<strong>An</strong>alysisofK-aryn-cubeInterconnectionNetworks".<br />
[10]J.T.DraperandJ.Ghosh.\AComprehensive<strong>An</strong>alytical<strong>Model</strong><strong>for</strong><strong>Wormhole</strong> [9]J.KimandC.R.Das.\HypercubeCommunicationDelay<strong>with</strong><strong>Wormhole</strong><strong>Routing</strong>". [8]W-J.Guan,W.K.Tsai,andD.Blough.\<strong>An</strong><strong>An</strong>alytical<strong>Model</strong><strong>for</strong><strong>Wormhole</strong><strong>Routing</strong> ParallelProcessingSymposium,pages650{654,April1993. IEEETrans.onComput<strong>ers</strong>,39(6),June1990. inMulticomputerInterconnectionNetworks".InProceedingsofSeventhInternational<br />
[11]Po-ChiHuandL.Kleinrock.\AQueueing<strong>Model</strong><strong>for</strong><strong>Wormhole</strong><strong>Routing</strong><strong>with</strong>Time-<br />
23:202{214,November1994. IEEETrans.onComput<strong>ers</strong>,43(7),July1994.<br />
[12]J.Duato.\ANecessaryandSucientCondition<strong>for</strong>Deadlock-freeAdaptive<strong>Routing</strong> <strong>Routing</strong>inMulticomputerSystems".JournalofParallelandDistributedComputing,<br />
[13]L.SchwiebertandD.N.Jayasimha.\ANecessaryandSucientCondition<strong>for</strong> tionsandNetworks,pages584{593,LasVegas,NV,U.S.,September1995. out".InProceedingsofthe4thInternationalConferenceonComputerCommunica-<br />
[14]Po-ChiHu.High-SpeedLocalAreaNetworksUsing<strong>Wormhole</strong><strong>Routing</strong>:<strong>Model</strong>ing 6(10):1055{67,October1995. in<strong>Wormhole</strong>Networks".IEEETransactionsonParallelandDistributedSystems,<br />
[15]RalphP.Grimaldi.DiscreteandCombinatorialMathematics:<strong>An</strong>AppliedIntroduction.Addison-Wesley,Reading,Mass.,2ndedition,1989.<br />
Deadlock-free<strong>Wormhole</strong><strong>Routing</strong>".JournalofParallelandDistributedComputing, andExtensions.PhDthesis,Univ<strong>ers</strong>ityofCali<strong>for</strong>nia,Los<strong>An</strong>geles,June1996. 32(1):103{117,January1996.<br />
[17]L.Kleinrock.CommunicationNets:StochasticMessageFlowandDelay.MgGraw- [16]JacobWillemCohen.TheSingleServerQueue.North-HollandPub.Co.,revised [18]HideakiTakagi.Queueing<strong>An</strong>alysis:AFoundationofPer<strong>for</strong>manceEvaluation, edition,1982. [19]WilliamH.Pressetal.NumericalRecipes:TheArtofScienticcomputing.CambridgeUniv<strong>ers</strong>ityPress,NewYork,1986.<br />
[20]L.Kleinrock.QueueingSystems,Vol.I:Theory.WileyInt<strong>ers</strong>cience,NewYork,1975. Hill,NewYork,1964.ReprintedbyDoverPublications,1972. volume2.North-Holland,NewYork,NY,U.S.A.,1993.