Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

Authors:
Baolei Cheng;Jianxi Fan;Xiaohua Jia;Jin Wang
Affiliations:
School of Computer Science and Technology, Soochow University, Suzhou 215006, China and Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, China;School of Computer Science and Technology, Soochow University, Suzhou 215006, China;Department of Computer Science, City University of Hong Kong, Hong Kong;School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Venue:
Journal of Parallel and Distributed Computing
Year:
2013

Citing 30
Cited 1

The multi-tree approach to reliability in distributed networks

Information and Computation
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

Journal of Algorithms
A Variation on the Hypercube with Lower Diameter

IEEE Transactions on Computers
Multiply-twisted hypercube with five or more dimensions is not vertex-transitive

Information Processing Letters
Reliable broadcasting in product networks

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach

IEEE Transactions on Parallel and Distributed Systems
Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation

IEEE Transactions on Parallel and Distributed Systems
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Fault-tolerant cycle-emebedding of crossed cubes

Information Processing Letters
Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy

Journal of Systems Architecture: the EUROMICRO Journal
The t/k-Diagnosability of the BC Graphs

IEEE Transactions on Computers
Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Finding Four Independent Trees

SIAM Journal on Computing
Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing
Embedding meshes into crossed cubes

Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

IEEE Transactions on Parallel and Distributed Systems
Edge-pancyclicity and path-embeddability of bijective connection graphs

Information Sciences: an International Journal
On Embedding Hamiltonian Cycles in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Embedding a family of disjoint 3D meshes into a crossed cube

Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in locally twisted cubes

Theoretical Computer Science
Constructing edge-disjoint spanning trees in twisted cubes

Information Sciences: an International Journal
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube

Information Sciences: an International Journal
Efficient unicast in bijective connection networks with the restricted faulty node set

Information Sciences: an International Journal
Constructing independent spanning trees for locally twisted cubes

Theoretical Computer Science
Independent spanning trees on twisted cubes

Journal of Parallel and Distributed Computing
A fast fault-identification algorithm for bijective connection graphs using the PMC model

Information Sciences: an International Journal
An efficient parallel construction of optimal independent spanning trees on hypercubes

Journal of Parallel and Distributed Computing
An algorithm to construct independent spanning trees on parity cubes

Theoretical Computer Science
Independent spanning trees in crossed cubes

Information Sciences: an International Journal

Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Independent spanning trees (ISTs) have increasing applications in fault-tolerance, bandwidth, and security. In this paper, we study the problem of parallel construction of ISTs on crossed cubes. We first propose the definitions of dimension-adjacent walk and dimension-adjacent tree along with a dimension property of crossed cubes. Then, we consider the parallel construction of ISTs on crossed cubes. We show that there exist n general dimension-adjacent trees which are independent of the addresses of vertices in the n-dimensional crossed cube CQ"n. Based on n dimension-adjacent trees and an arbitrary root vertex, a parallel algorithm with the time complexity O(2^n) is proposed to construct n ISTs on CQ"n, where n=1.