Simulation studies of routing algorithms for multicomputer systems Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Efficient routing of messages is critical to the performance of multicomputers. Many adaptive routing algorithms have been proposed to improve the network efficiency; however, they can make only short-sighted decisions to choose a channel for message routing because of limited information about network condition. The short-sighted decisions may cause unnecessary waits at the next clock cycle if the adaptive routing algorithm chooses a channel which has high probability of message block at the next clock cycle. In this thesis, look-ahead routing scheme is introduced to provide better performance for conventional adaptive routing algorithms. The look-ahead scheme as an adaptive routing algorithm makes longer-sighted decision to avoid possible blocks at the next clock cycle. This thesis also simulates the XY, the West-First, and the Double-Y channel routing algorithms, which are deterministic, partially-adaptive and fully-adaptive, respectively, in a 16 x 16 mesh network. Their performances are compared and analyzed. The simulation includes the examination of look-ahead effect for the West-First and the Double-Y channel routing algorithms.
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
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale) 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-08T18:46:54Z (GMT) No. of bitstreams: 1 ChoiJangmin1995.pdf: 3177336 bytes, checksum: 02701314a8b3bec06d12bc85e7a27063 (MD5)
  • description.provenance : Submitted by John Valentino (valentjo@onid.orst.edu) on 2012-11-07T20:04:51Z No. of bitstreams: 1 ChoiJangmin1995.pdf: 3177336 bytes, checksum: 02701314a8b3bec06d12bc85e7a27063 (MD5)
  • description.provenance : Made available in DSpace on 2012-11-08T18:46:54Z (GMT). No. of bitstreams: 1 ChoiJangmin1995.pdf: 3177336 bytes, checksum: 02701314a8b3bec06d12bc85e7a27063 (MD5) Previous issue date: 1995-06-28
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-07T22:51:39Z (GMT) No. of bitstreams: 1 ChoiJangmin1995.pdf: 3177336 bytes, checksum: 02701314a8b3bec06d12bc85e7a27063 (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items