Performance evaluation and router design for backtrack-to-the-origin-and-retry routing in hypercycle-based interconnection networks

Simple item page
dc.contributor.authorRadvan, Donen_US
dc.date.accessioned2024-08-15T17:36:56Z
dc.date.available2024-08-15T17:36:56Z
dc.date.copyright1990en_US
dc.date.issued1990
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science M.A.Sc.en
dc.description.abstractHypercycles are a class of multidimensional graphs which are generalizations of the binary n-cube. These graphs are obtained by allowing each dimension to incorporate two or more vertices and a cyclic interconnection strategy. Hypercycles offer simple routing and, the ability, given a fixed degree, to choose among a number of alternative size graphs. These graphs can be used in the design of interconnection networks for distributed computing systems tailored specifically to the topology of a particular application. Hypercycles use a routing policy, whereupon paths that block at intermediate nodes are abandoned and a new attempt is made using an alternate path. Intermediate nodes are chosen at random at each point from among the ones that form the shortest paths from a source to a destination. This thesis presents a computer-based simulator for simulating all such Hypercycle networks. The results of this simulator present a favourable comparison of the above-mentioned routing policy with that of e-cube routing in terms of overall message delay. Furthermore, the implementation of a Hypercycle router is discussed in detail and a partial design suitable for VLSI implementation is presented along with results from hardware simulations performed on this design. This is done to show that the space-time complexity of the system can be reduced to the point where realization in current technology is feasable.
dc.format.extent153 pages
dc.identifier.urihttps://hdl.handle.net/1828/19420
dc.rightsAvailable to the World Wide Weben_US
dc.titlePerformance evaluation and router design for backtrack-to-the-origin-and-retry routing in hypercycle-based interconnection networksen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
RADVAN_Don_MSC_1990_515073.pdf
Size:
31.34 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.