Resource placement, data rearrangement, and Hamiltonian cycles in torus networks Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is becoming a popular topology for the interconnection network of a high performance parallel computers. In a multicomputer, the resources, such as I/O devices or software packages, are distributed over the networks. The first part of the thesis investigates efficient methods of distributing resources in a torus network. Three classes of placement methods are studied. They are (1) distant-t placement problem: in this case, any non-resource node is at a distance of at most t from some resource nodes, (2) j-adjacency problem: here, a non-resource node is adjacent to at least j resource nodes, and (3) generalized placement problem: a non-resource node must be a distance of at most t from at least j resource nodes. This resource placement technique can be applied to allocating spare processors to provide fault-tolerance in the case of the processor failures. Some efficient spare processor placement methods and reconfiguration schemes in the case of processor failures are also described. In a torus based parallel system, some algorithms give best performance if the data are distributed to processors numbered in Cartesian order; in some other cases, it is better to distribute the data to processors numbered in Gray code order. Since the placement patterns may be changed dynamically, it is essential to find efficient methods of rearranging the data from Gray code order to Cartesian order and vice versa. In the second part of the thesis, some efficient methods for data transfer from Cartesian order to radix order and vice versa are developed. The last part of the thesis gives results on generating edge disjoint Hamiltonian cycles in k-ary n-cubes, hypercubes, and 2D tori. These edge disjoint cycles are quite useful for many communication 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) 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 : Made available in DSpace on 2012-10-04T17:19:10Z (GMT). No. of bitstreams: 1 BaeMyungMun1997.pdf: 3874587 bytes, checksum: fcee1c3a00ff67ac334bbd1325942e59 (MD5) Previous issue date: 1996-11-14
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-10-04T17:19:10Z (GMT) No. of bitstreams: 1 BaeMyungMun1997.pdf: 3874587 bytes, checksum: fcee1c3a00ff67ac334bbd1325942e59 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-10-04T17:17:00Z (GMT) No. of bitstreams: 1 BaeMyungMun1997.pdf: 3874587 bytes, checksum: fcee1c3a00ff67ac334bbd1325942e59 (MD5)
  • description.provenance : Submitted by John Valentino (valentjo@onid.orst.edu) on 2012-10-03T00:28:49Z No. of bitstreams: 1 BaeMyungMun1997.pdf: 3874587 bytes, checksum: fcee1c3a00ff67ac334bbd1325942e59 (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items