A linear equation model for a family of interconnection networks Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • The most important part of parallel computation is communication. Except in the most embarassingly parallel examples, processors cannot work cooperatively to solve a problem unless they can communicate. One way to solve the problem of communication is to use an interconnection network. Processors are located at nodes of the network, which are joined by communication channels. Desirable aspects of an interconnection network include low maximum and average routing distances (as measured in the number of communication channels crossed), a large number of processors, and low number of communication channels per processor. A number of published networks are created from the hypercube by rearranging the hypercube's communication links in a systematic way [23] [28] [30] [33] [50]. These networks maintain the same number of processors, communication links, and links per processor as the hypercube, but have dramatically smaller maximum and average routing distances. This thesis derives one formal mathematical description for this family of networks. This formal description is used to derive graph-theoretic properties of existing networks, and to design new networks. The description is also used to design generalized routing and other communications algorithms for these networks, and to show that these networks can embed and simulate other standard networks, for instance, ring and mesh networks. A network simulator is used to model the dynamic behavior of this family of networks under both store-and-forward and wormhole routing strategies for message-passing. The simulation results are used to study and compare the networks' behavior under various message-passing loads, and to determine what properties are desirable in a network that exists in this model.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-09T18:20:13Z (GMT) No. of bitstreams: 1 LarsonShawnM1995.pdf: 11422230 bytes, checksum: bb8ccb92652ad392cfa3a3b06f7a51bb (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-20T22:25:59Z (GMT) No. of bitstreams: 1 LarsonShawnM1995.pdf: 11422230 bytes, checksum: bb8ccb92652ad392cfa3a3b06f7a51bb (MD5)
  • description.provenance : Made available in DSpace on 2012-11-20T22:25:59Z (GMT). No. of bitstreams: 1 LarsonShawnM1995.pdf: 11422230 bytes, checksum: bb8ccb92652ad392cfa3a3b06f7a51bb (MD5) Previous issue date: 1995-05-04
  • description.provenance : Submitted by Tamera Ontko (toscannerosu@gmail.com) on 2012-11-08T21:57:16Z No. of bitstreams: 1 LarsonShawnM1995.pdf: 11422230 bytes, checksum: bb8ccb92652ad392cfa3a3b06f7a51bb (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items