Show simple item record

dc.contributor.authorLevitin, Lev B.en_US
dc.contributor.authorRykalova, Yelenaen_US
dc.date.accessioned2020-05-18T17:54:39Z
dc.date.available2020-05-18T17:54:39Z
dc.date.issued2019
dc.identifier.citationLev B Levitin, Yelena Rykalova. 2019. "Computer interconnection networks with virtual cut-through routing." Procedia Computer Science, Volume 155, pp. 449 - 455. https://doi.org/10.1016/j.procs.2019.08.062
dc.identifier.issn1877-0509
dc.identifier.urihttps://hdl.handle.net/2144/40966
dc.description.abstractThis paper considers a model of a toroidal computer interconnection network with the virtual cut-through routing. The interrelationships between network parameters, load and performance are analyzed. An exact analytical expression for the saturation point and expressions for the latency as a function of the message generation rate under the mean field theory approximation have been obtained. The theoretical results have been corroborated with the results of simulation experiments for various values of network parameters. The network behavior has been found not depending on the torus linear dimensions provided that they are at least twice as large as the message path length. The saturation point has been found to be inversely proportional to the message length in good agreement with the analytical results. A good agreement with Little’s theorem has been found if the network remains in the steady state during the experiment.en_US
dc.format.extentp. 449 - 455en_US
dc.languageen
dc.language.isoen_US
dc.publisherElsevier BVen_US
dc.relation.ispartofProcedia Computer Science
dc.rightsCopyright 2019 The Authors. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectInformation and computing sciencesen_US
dc.subjectTechnologyen_US
dc.subjectComputer interconnection networksen_US
dc.subjectNetwork-on-chipen_US
dc.subjectNetwork torus topologyen_US
dc.subjectCut-through routingen_US
dc.subjectLatencyen_US
dc.subjectSaturation in networksen_US
dc.titleComputer interconnection networks with virtual cut-through routingen_US
dc.typeArticleen_US
dc.description.versionAccepted manuscripten_US
dc.identifier.doi10.1016/j.procs.2019.08.062
pubs.elements-sourcecrossrefen_US
pubs.notesEmbargo: No embargoen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Electrical & Computer Engineeringen_US
pubs.publication-statusPublisheden_US
dc.identifier.mycv548008


This item appears in the following Collection(s)

Show simple item record

Copyright 2019 The Authors. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Except where otherwise noted, this item's license is described as Copyright 2019 The Authors. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)