Index Catalog // ScholarsArchive@OSU

Start Over

Filtering by: Creator Spyridakis, Dimitri E. Advisor Bose, Bella

On edge disjoint Hamiltonian cycles in torus and Gaussian networks

Creator:

Alazemi, Fawaz M.

Abstract:

Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...

Resource Type:

Masters Thesis

Full Text:

networks. A graph is an ordered pair G = (V,E) where V is a finite set of vertices (also called nodes) and
Some communication algorithms for Gaussian and Eisenstein-Jacobi networks

Creator:

Albader, Bader

Abstract:

Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi integers were introduced. In this research, efficient routing and broadcasting algorithms for these networks are developed. Furthermore, constructing edge disjoint Hamiltonian cycles in Gaussian networks...

Resource Type:

Dissertation

Full Text:

integers as follows. Definition 2.1[27]: Given 𝛼 = 𝑎 + 𝑏𝑖 ∈ ℤ[𝑖], we define the graph 𝐺𝛼(𝑉, 𝐸
Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

Creator:

Shamaei, Arash

Abstract:

Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algorithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to...

Resource Type:

Dissertation

Full Text:

by a routing algorithm. The resource dependence graph can be defined as a directed graph G = (V,E