Back to results

University of Nevada, Las Vegas

Fault-tolerance embedding of rings and arrays in star and pancake graphs

Abstract

dc:description.abstract

The star and pancake graphs are useful interconnection networks for connecting processors in a parallel and distributed computing environment. The star network has been widely studied and is shown to possess attactive features like sublogarithmic diameter, node and edge symmetry and high resilience. The star/pancake interconnection graphs, {dollar}S\sb{n}/P\sb{n}{dollar} of dimension n have n! nodes connected by {dollar}{(n-1).n!\over2}{dollar} edges. Due to their large number of nodes and interconnections, they are prone to failure of one or more nodes/edges; In this thesis, we present methods to embed Hamiltonian paths (H-path) and Hamiltonian cycles (H-cycle) in a star graph {dollar}S\sb{n}{dollar} and pancake graph {dollar}P\sb{n}{dollar} in a faulty environment. Such embeddings are important for solving computational problems, formulated for array and ring topologies, on star and pancake graphs. The models considered include single-processor failure, double-processor failure, and multiple-processor failures. All the models are applied to an H-cycle which is formed by visiting all the ({dollar}{n!\over4!})\ S\sb4/P\sb4{dollar}s in an {dollar}S\sb{n}/P\sb{n}{dollar} in a particular order. Each {dollar}S\sb4/P\sb4{dollar} has an entry node where the cycle/path enters that particular {dollar}S\sb4/P\sb4{dollar} and an exit node where the path leaves it. Distributed algorithms for embedding hamiltonian cycle in the presence of multiple faults, are also presented for both {dollar}S\sb{n}{dollar} and {dollar}P\sb{n}{dollar}.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Electrical and Computer Engineering
Grantor dc:publisher
University of Nevada, Las Vegas
Year
1995

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gajjala, Ramesh Reddy
Contributors dc:contributor
  • Shahram Latifi

Rights

dc:rights
Statement dc:rights
  • IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/
Language dc:language
English

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:oasis.library.unlv.edu:rtds-1453

Chain of custody

source
Harvested from
University of Nevada - Las Vegas
Base URL
oasis.library.unlv.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
related terms
citation

Gajjala, Ramesh Reddy. Fault-tolerance embedding of rings and arrays in star and pancake graphs. Thesis thesis, University of Nevada, Las Vegas, 1995. https://doi.org/10.25669/pgj1-yls7