The Macro-star graph which has the star graph as a basic module has node symmetry, maximum fault tolerance, and hierarchical decomposition property. And, it is an interconnection network which improves a network cost against the star graph. A Matrix-star g
Embedding Algorithm Between the Macro-star
Graph and the Matrix-star Graph
*
1 Kim jeong-suk 1, Seo jung-hyun 2, Sim Hyun 3, Lee HyeongOk 4,
Department of Computer Science, Oklahoma State University, USA 2,3 Department of Computer Science, Sunchon National University, 315 Maegok-dong, Sunchon,
Chonnam, 540-742, Korea
{, }, 82-61-752-3625
4 Department of Computer Education, Sunchon National University, 315 Maegok-dong,
Sunchon, Chonnam, 540-742, Korea , 82-61-750-3345
Index Term – Interconnection Network, Macro-star, Matrix-star, Embedding Algorithm, Star Graph
Abstract
The Macro-star graph which has the star graph as a basic module has node symmetry, maximum fault tolerance, and hierarchical decomposition property. And, it is an interconnection network which improves a network cost against the star graph. A Matrix-star graph also has such a good properties of the Macro-star graph and is an interconnection network which has a lower network cost than the Macro-star graph.
In this paper, we propose a method to embed between the Macro-star graph and a Matrix-star graph. We show that the Macro-star graph MS(k,n) can be embedded into a Matrix-star graph MSk,n+1 with dilation 2. In addition, we show that a Matrix-star graph MSk,n can be embedded into the Macro-star graph MS(k,n+1) with dilation 4 and average dilation 3 or less as well. This result means that several algorithms developed in the star graph can be simulated in a Matrix-star graph at a lower cost.
1. Introduction
Parallel processing computer is classified multiprocessor which has shared-memory and multi-computer which uses distributed-memory. In the multi-computer system, each processor has its own local memory and is connecting by an interconnection network.
* This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (R05-2004-000-11669-0)
A new fast algorithm for computing the distance between two disjoint convex polygons based on Vo_专业资料。维普资讯 http://www.cqvip.com 12 52 Yn l...
A Video Zero-watermark Algorithm Based on the ...Combination must be done between LP and DFB. ...(b)Image after watermark embedding Fig.1.10 ...
Algorithm Based on the Frame-Level RDO Ruan ...between heterogeneous networks and video surveillance...the macro block coding mode, according to the ...
the time lag between the initial development of ...the star formation modeling algorithm in SPH code... star formation macro region (like a globular ...
Algorithm System level design Embedding software ... what are the differences between synthesis and ...Macro Time and Micro Time Macro Time — standard...
embedding, mesh of trees 1 Introduction The ...We construct 2 paths between any two pairs of ...9. Yannakakis, M., A polynomial algorithm for ...
we described a fast self-organizing algorithm for embedding a set of ...(SPE), attempts to preserve the geodesic distances between the embedded ...
The proposed MFoM learning algorithm takes full ...the ability to discriminate between positive and ...By a smooth embedding of the decision function, ...
Reversible Data Embedding Scheme Using Relationships between Pixel-Values and Their Neighbors_专业资料。283 JOURNAL LERONISEOFECTC CINCEAND TECHNOLOGY,VOL.0NO.,...
The proposed MFoM learning algorithm takes full ...the ability to discriminate between positive and ...By a smooth embedding of the decision function, ...
热门文档