82 research outputs found
Star Structure Connectivity of Folded hypercubes and Augmented cubes
The connectivity is an important parameter to evaluate the robustness of a
network. As a generalization, structure connectivity and substructure
connectivity of graphs were proposed. For connected graphs and , the
-structure connectivity (resp. -substructure connectivity
) of is the minimum cardinality of a set of subgraphs
of that each is isomorphic to (resp. to a connected subgraph of ) so
that is disconnected or the singleton. As popular variants of hypercubes,
the -dimensional folded hypercubes and augmented cubes are
attractive interconnected network prototypes for multiple processor systems. In
this paper, we obtain that
for , , and
for
The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes
As a generalization of vertex connectivity, for connected graphs and ,
the -structure connectivity (resp. -substructure
connectivity ) of is the minimum cardinality of a set of
subgraphs of that each is isomorphic to (resp. to a connected
subgraph of ) so that is disconnected. For -dimensional hypercube
, Lin et al. [6] showed
and
for
and . Sabir et al. [11] obtained that
for
, and for -dimensional folded hypercube ,
,
with and . They proposed an open problem of
determining -structure connectivity of and for general
. In this paper, we obtain that for each integer ,
and
for all integers larger than in quare scale. For , we
separately confirm the above result holds for in the remaining cases
The structure connectivity of Data Center Networks
Last decade, numerous giant data center networks are built to provide
increasingly fashionable web applications. For two integers and
, the -dimensional DCell network with -port switches
and -dimensional BCDC network have been proposed. Connectivity is a
basic parameter to measure fault-tolerance of networks. As generalizations of
connectivity, structure (substructure) connectivity was recently proposed. Let
and be two connected graphs. Let be a set whose elements
are subgraphs of , and every member of is isomorphic to
(resp. a connected subgraph of ). Then -structure connectivity (resp. -substructure connectivity ) of is the size
of a smallest set of such that the rest of is disconnected or
the singleton when removing . Then it is meaningful to calculate
the structure connectivity of data center networks on some common structures,
such as star , path , cycle , complete graph and so
on. In this paper, we obtain that for and for by analyzing
the structural properties of . We also compute and
for and by using -extra connectivity of
Computational methods and software systems for dynamics and control of large space structures
Two key areas of crucial importance to the computer-based simulation of large space structures are discussed. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area involves massively parallel computers
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model
System diagnosis is process of identifying faulty nodes in a system. An
efficient diagnosis is crucial for a multiprocessor system. The BGM diagnosis
model is a modification of the PMC diagnosis model, which is a test-based
diagnosis. In this paper, we present a specific structure and propose an
algorithm for diagnosing a node in a system under the BGM model. We also give a
polynomial-time algorithm that a node in a hypercube-like network can be
diagnosed correctly in three test rounds under the BGM diagnosis model
- …