Some properties of WK-recursive and swapped networks

Authors:
Navid Imani;Hamid Sarbazi-Azad;Albert Y. Zomaya
Affiliations:
IPM School of Computer Science, Tehran, Iran;Sharif University of Technology, Tehran, Iran and IPM School of Computer Science, Tehran, Iran;School of Information Technologies, University of Sydney, Sydney, Australia
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 8
Cited 2

Topological properties of WK-recursive networks

Journal of Parallel and Distributed Computing
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors

Proceedings of the 2005 ACM symposium on Applied computing
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
On Some Combinatorial Properties of the Star Graph

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
The WK-Recursive Pyramid: An Efficient Network Topology

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II

On the Surface Area of the (n, k)-Star Graph

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the surface area of the (n,k)-star graph

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks due to their useful recursive structures.