On resource placements and fault-tolerant broadcasting in toroidal networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/70795b293

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Parallel computers are classified into: Multiprocessors, and multicomputers. A multiprocessor system usually has a shared memory through which its processors can communicate. On the other hand, the processors of a multicomputer system communicate by message passing through an interconnection network. A widely used class of interconnection networks is the toroidal networks. Compared to a hypercube, a torus has a larger diameter, but better tradeoffs, such as higher channel bandwidth and lower node degree. Results on resource placements and fault-tolerant broadcasting in toroidal networks are presented. Given a limited number of resources, it is desirable to distribute these resources over the interconnection network so that the distance between a non-resource and a closest resource is minimized. This problem is known as distance-d placement. In such a placement, each non-resource must be within a distance of d or less from at least one resource, where the number of resources used is the least possible. Solutions for distance-d placements in 2D and 3D tori are proposed. These solutions are compared with placements used so far in practice. Simulation experiments show that the proposed solutions are superior to the placements used in practice in terms of reducing average network latency. The complexity of a multicomputer increases the chances of having processor failures. Therefore, designing fault-tolerant communication algorithms is quite necessary for a sufficient utilization of such a system. Broadcasting (single-node one-to-all) in a multicomputer is one of the important communication primitives. A non-redundant fault-tolerant broadcasting algorithm in a faulty toroidal network is designed. The algorithm can adapt up to (2n-2) processor failures. Compared to the optimal algorithm in a fault-free n-dimensional toroidal network, the proposed algorithm requires at most 3 extra communication steps using cut through packet routing, and (n + 1) extra steps using store-and-forward routing.
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) using Capture Perfect 3.0 on a Canon DR-9050C 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-09-20T17:38:05Z (GMT) No. of bitstreams: 1 AlMohammadBaderFahedAlBedaiwi1998.pdf: 4093208 bytes, checksum: 2ea3e20c9947e22cf5a7caff2c056672 (MD5)
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2012-09-19T22:59:44Z No. of bitstreams: 1 AlMohammadBaderFahedAlBedaiwi1998.pdf: 4093208 bytes, checksum: 2ea3e20c9947e22cf5a7caff2c056672 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-09-20T17:41:03Z (GMT) No. of bitstreams: 1 AlMohammadBaderFahedAlBedaiwi1998.pdf: 4093208 bytes, checksum: 2ea3e20c9947e22cf5a7caff2c056672 (MD5)
  • description.provenance : Made available in DSpace on 2012-09-20T17:41:03Z (GMT). No. of bitstreams: 1 AlMohammadBaderFahedAlBedaiwi1998.pdf: 4093208 bytes, checksum: 2ea3e20c9947e22cf5a7caff2c056672 (MD5) Previous issue date: 1997-11-13

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items