Processor allocation & communication in networks Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We will describe two known strategies for static processor allocation in an n-cube multiprocessor, namely the buddy system strategy and the gray code strategy, and then propose a new strategy that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in cube recognition. Furthermore, our strategy is suitable for static as well as dynamic processor allocation and results in less system fragmentation, more subcubes recognition and higher fault tolerance. We also introduce an extension to our strategy that will enhance the performance drastically so that our algorithm, together with the extension, will outperform the buddy system by a factor of [k(n-k)+1] and the gray strategy by [k(n-k)+1]/2 in cube recognition. The implementation details of these algorithms are also described. The cube-connected cycles network is an attractive alternative for the n-cube, since it overcomes the degree problem by limiting it to 3. However, there are large gaps in the size of systems that can be built. We propose and study cube-connected cycles networks that are missing some of their cycles, called incomplete cube-connected cycles networks. These incomplete cube-connected cycles networks can be used to interconnect systems with any number of processors, thus overcoming the severe restriction of the complete cube-connected cycles networks. In incomplete cube-connected networks the processors are well utilized, routes are shorter and the layout area is a lot smaller. We develop efficient routing and broadcasting algorithms and show how to lay this network on a chip. Broadcasting is a procedure by which a processor can pass a message to all other processors in the network nonredundantly. It is extremely important for diagnosis of the network, distribution agreement and clock synchronization. We briefly describe the algorithm for broadcasting in the hypercube developed by Sullivan and Bashkow, then we develop a simple yet efficient fault tolerant broadcasting algorithm for the hypercube in the presence of some faulty processors. We develop an efficient algorithm for broadcasting in the cube-connected cycles network. Another broadcasting algorithm for cube-connected cycles networks with faulty cycles is also developed.
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 2013-05-24T17:29:00Z (GMT) No. of bitstreams: 1 AlDhelaanAbdullahM1989.pdf: 1122152 bytes, checksum: 8fc96137fe103eaf6a7f870528a791c9 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-06-27T20:36:34Z (GMT) No. of bitstreams: 1 AlDhelaanAbdullahM1989.pdf: 1122152 bytes, checksum: 8fc96137fe103eaf6a7f870528a791c9 (MD5)
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2013-05-16T19:08:43Z No. of bitstreams: 1 AlDhelaanAbdullahM1989.pdf: 1122152 bytes, checksum: 8fc96137fe103eaf6a7f870528a791c9 (MD5)
  • description.provenance : Made available in DSpace on 2013-06-27T20:36:34Z (GMT). No. of bitstreams: 1 AlDhelaanAbdullahM1989.pdf: 1122152 bytes, checksum: 8fc96137fe103eaf6a7f870528a791c9 (MD5) Previous issue date: 1989-03-17

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items