On shortest disjoint paths and Hamiltonian cycles in some interconnection networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/4b29b8867

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Parallel processors are classified into two classes: shared-memory multiprocessors and distributed- memory multiprocessors. In the shared-memory system, processors communicate through a common memory unit. However, in the distributed multiprocessor system, each processor has its own memory unit and the communications among the processors are performed through an interconnection network. Thus, the interconnection topology plays an important role in the performance of these parallel systems. Recently, some new classes of interconnection networks, referred as Gaussian and Eisenstein- Jacobi networks, have been introduced. In this dissertation, we study the problem of finding the shortest node disjoint paths in the Gaussian and the Eisenstein-Jacobi networks. Moreover, we also describe how to generate edge disjoint Hamiltonian cycles in Eisenstein- Jacobi and Generalized Hypercube networks. Node disjoint paths are paths between any given source and destination nodes such that the paths have no common nodes except the endpoints. Similarly, edge disjoint Hamiltonian cycles are cycles in a given graph where each node is visited once and returns to the starting node and every edge is in at most one cycle.
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
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2011-05-04T17:37:48Z (GMT) No. of bitstreams: 1 HussainZaidA2011.pdf: 910776 bytes, checksum: 1c895ed6742557fd5c5240ffa684c160 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2011-05-05T15:08:18Z (GMT) No. of bitstreams: 1 HussainZaidA2011.pdf: 910776 bytes, checksum: 1c895ed6742557fd5c5240ffa684c160 (MD5)
  • description.provenance : Made available in DSpace on 2011-05-05T15:08:18Z (GMT). No. of bitstreams: 1 HussainZaidA2011.pdf: 910776 bytes, checksum: 1c895ed6742557fd5c5240ffa684c160 (MD5)
  • description.provenance : Submitted by Zaid Hussain (hussainz@onid.orst.edu) on 2011-05-04T16:52:13Z No. of bitstreams: 1 HussainZaidA2011.pdf: 910776 bytes, checksum: 1c895ed6742557fd5c5240ffa684c160 (MD5)

Relationships

In Administrative Set:
Last modified: 08/15/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items