Show simple item record

dc.contributor.authorRavikumar, C P
dc.contributor.authorGoel, A M
dc.date.accessioned2006-05-09T06:30:51Z
dc.date.accessioned2019-02-09T07:34:05Z
dc.date.available2006-05-09T06:30:51Z
dc.date.available2019-02-09T07:34:05Z
dc.date.issued1995
dc.identifier.citationComputers and Digital Techniques, IEE Proceedings, 142(6), 395 - 400en
dc.identifier.urihttp://localhost:8080/xmlui/handle/12345678/1637
dc.description.abstractFor constructing massively parallel multicomputers with over 5000 processing nodes, the star graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in star graph, assuming the wormhole routing model. Both the algorithms use the concept of virtual channels introduced by W. Dally and C.L. Seitz (1987). The first algorithm is non-optimal in terms of the average routing distance, but uses fewer virtual channels on the whole. The second algorithm is optimal in terms of routing performance, but requires a somewhat larger number of virtual channels per nodeen
dc.format.extent75877 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.subjectstar graph topologyen
dc.subjectdeadlock-free algorithmsen
dc.subjectwormhole routing modelen
dc.subjectvirtual channels per nodeen
dc.titleDeadlock-free wormhole routing algorithms for star graph topologyen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record