Log in
|
Help
|
English

English

Engish-Pirate

한국어

Search

Advanced Search

Find results with:

Add another field

Search by date

to

Searching collections:

CCSU Theses and Dissertations

Add or remove collections

Home Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes /...

Reference URL

Share

Add tags

Comment

Rate

To link to this object, paste this link in email, IM or document

To embed this object, paste this HTML in website

Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes / Jennette C. Fisher

View Description

Download

small (250x250 max)

medium (500x500 max)

large ( > 500x500)

Full Resolution

Print

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Select the collections to add or remove from your search

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

Select All Collections

C

CCSU Student Publications

CCSU Theses and Dissertations

G

GLBTQ Archives

M

Modern Language Oral Histories

O

O'Neill Archives Oral Histories

P

Polish American Pamphlets

T

Treasures from the Special Collections

V

Veterans History Project

OK

Cancel

Identifier	Thesis 1941
Author	Fisher, Jennette Caryl, 1970-
Title	Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes / Jennette C. Fisher
Publisher	Central Connecticut State University
Date	2008
Resource Type	Master's Thesis
Notes	We present a collection of algorithms which are used to construct Hamiltonian paths and cycles in hypercube networks with faulty nodes. In graph theoretical terms, the hypercube is a connected, undirected graph composed of edges and nodes, or vertices, A hypercube (Qn) of degree n has 2n nodes each of which is connected to n other nodes. The hypercube is a popular topology for large computer networks. Hypercube networks are favored in parallel processing because of their high fault tolerance and because several other graphs can be isometrically embedded within a hypercube. A fault is a mass of faulty nudes. Since individual processors within a connected network may fail, there is a need to design fault tolerant systems. The ability to identify a fault free cycle within a faulty hypercube network makes it possible to run programs which were designed to be implemented on a connected ring of processors, even when some faults exist within the hypercube network. In order to make maximum use of a given network, one would want to identify. the largest fault free cycle given a specified number and configuration of faults, While there has been a great deal of research on hypercube networks, there is very little which addresses the ability to find maximal Hamiltonian cycles and paths among the non-faulty nodes in a hypercube network. The majority of the research which does exist is theoretical. Recently, a team of researchers has presented a collection of proofs of the existence of Hamiltonian paths and cycles in faulty hypercubes. In this thesis we develop computer programs which can be used to produce such paths and cycles. These programs can be used by researchers to develop greater understanding of paths and cycles in faulty hypercube networks.
Subject	Hypercube Hypercube networks (Computer networks) Fault-tolerant computing
Department	Department of Mathematical Sciences
Advisor	Castañeda, Nelson
Type	Text
Digital Format	application/pdf
Language	eng
OCLC number	262286162
Rating

Find results with:

Searching collections:

Home Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes /...

Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes / Jennette C. Fisher

Description

Tags

Comments