Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 40121 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Movaghar, Ali
- Abstract:
- A parallel computer system is composed of a collection of processors used to speed up running a program or performance of multiple programs. If we consider the processors as nodes and the channels between processors as edges, the constructed graph represents an interconnection networks. Network topology affects performance and energy consumption of interconnection network very much. Some parameters of topology quality are low node degree and diameter, high connectivity degree and bisection width and symmetry. Since some of these parameters are in contrast with others, a network with more parameter improvements, is more desirable. Finding cycles with specific length and particularly Hamiltonian cycle, is one of most important problems in networks. Because if a network has such cycles , it will have some useful properties and some related algorithms on this network will be implemented more conveniently and have higher performance. In this thesis, we study Pancyclicity properties of OTIS networks. We will prove that if factor graph G contains a cycle of length l, this would give total cycles of length l^2-kl, 0≤k≤(l-1), in OTIS- G. In addition, we present a sufficient condition for Pancyclicity of OTIS network and then improve the condition. We show for 2-d and 3-d Mesh and Trous which have at least one dimension of even nodes, OTIS-Mesh and OTIS-Trous are ∑ ̅-Pancyclic for ∑={3,5}.
- Keywords:
- Interconnect Network ; Routes ; Pancyclicity ; Hamiltonian Cycle Problem ; Optical Transpose Interconnection System (OTIS)Multicomputer
Digital Object List-
محتواي پايان نامه - view
Bookmark