Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/ks65hh45h

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algo­rithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to classical multidimen­sional toroidal networks. For this topology, we explore many properties including distance distribution and the decomposition of higher dimensional Gaussian net­ works into Hamiltonian cycles. In addition, we propose some efficient communi­cation algorithms for higher dimensional Gaussian networks including one-to-all broadcasting and shortest path routing. Simulation results show that the rout­ing algorithm proposed for higher dimensional Gaussian networks outperforms the routing algorithm of the corresponding torus networks with approximately the same number of nodes. These simulation results are expected since higher dimen­sional Gaussian networks have a smaller diameter and a smaller average message latency as compared with toroidal networks. Finally, we introduce a degree-three interconnection network obtained from pruning a Gaussian network. This network shows possible performance improve­ment over other degree-three networks since it has a smaller diameter compared to other degree-three networks. Many topological properties of degree-three pruned Gaussian network are explored. In addition, an optimal shortest path routing algorithm and a one-to-all broadcasting algorithm are given.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2015-12-16T18:42:13Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) ShamaeiArash2015.pdf: 2982716 bytes, checksum: 7c1b239f147504cf6bec12d9c5367216 (MD5)
  • description.provenance : Made available in DSpace on 2015-12-16T18:42:14Z (GMT). No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) ShamaeiArash2015.pdf: 2982716 bytes, checksum: 7c1b239f147504cf6bec12d9c5367216 (MD5) Previous issue date: 2015-12-10
  • description.provenance : Submitted by Arash Shamaei (shamaeia@oregonstate.edu) on 2015-12-12T02:37:44Z No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) ShamaeiArash2015.pdf: 2982716 bytes, checksum: 7c1b239f147504cf6bec12d9c5367216 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2015-12-16T17:20:04Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) ShamaeiArash2015.pdf: 2982716 bytes, checksum: 7c1b239f147504cf6bec12d9c5367216 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items