Index Catalog // ScholarsArchive@OSU

Start Over

Filtering by: Alternative title ssim 4-H 032 Advisor Bose, Bella License All rights reserved

One-to-many node disjoint paths routing in generalized hypercube, dense Gaussian, and hexagonal mesh networks

Creator:

Alsaleh, Omar I.

Abstract:

Routing from a single source node to multiple destination nodes using node disjoint paths (NDP) has many important applications in parallel systems. For example, if a source node wants to send distinct messages to distinct destination nodes, then the one-to-many NDP routing is useful. Unlike parallel systems with shared-memory, each...

Resource Type:

Dissertation

Full Text:

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3
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:

) = (H1 ⊗H3)⊕ (H2 ⊕H4) = T 2k2 ⊕ T 2k2 = H ′1 ⊕H ′2 ⊕H ′3 ⊕H ′4 Ck1 ⊗ Ck2 ⊗ · · · ⊗ Ck2n = T 2nk = (Ck1
Gray codes and their applications

Creator:

Anantha, Madhusudhanan

Abstract:

An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...

Resource Type:

Dissertation

Full Text:

payroll. TABLE OF CONTENTS (Continued) Page Chapter 1: Introduction 1 Chapter 2: Background 4 2.1