Optimal broadcasting for locally twisted cubes

Authors:
Xiaofan Yang;Lei Wang;Luxing Yang
Affiliations:
College of Computer Science, Chongqing University, Chongqing 400044, PR China and College of Mathematics and Statistics, Chongqing University, Chongqing 400044, PR China;College of Computer Science, Chongqing University, Chongqing 400044, PR China;College of Computer Science, Chongqing University, Chongqing 400044, PR China and College of Mathematics and Statistics, Chongqing University, Chongqing 400044, PR China
Venue:
Information Processing Letters
Year:
2012

Citing 6
Cited 0

Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Fault-tolerant pancyclicity of augmented cubes

Information Processing Letters
Fault-tolerant analysis of a class of networks

Information Processing Letters
Constructing edge-disjoint spanning trees in locally twisted cubes

Theoretical Computer Science
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

Information Processing Letters
Embedding meshes into locally twisted cubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper addresses the single node broadcast problem over a locally twisted cube (LTQ). The broadcast algorithm proposed for this problem uses a new broadcast tree construction which can run in time O(NlogN) where N=2^n is the number of the nodes in LTQ. The broadcast tree turns out to be optimal in terms of the number of transmission steps. To the best of our knowledge, it is the first time to present an optimal broadcast algorithm for LTQ.