• Title/Summary/Keyword: Graph Interconnection

Search Result 68, Processing Time 0.032 seconds

Cycle Property in the (n,k)-star Graph ((n,k)-스타 그래프의 사이클 특성)

  • Chang, Jung-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1464-1473
    • /
    • 2000
  • In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

  • PDF

Matrix Hypercube Graphs : A New Interconnection Network for Parallel Computer (행렬 하이퍼큐브 그래프 : 병렬 컴퓨터를 위한 새로운 상호 연결망)

  • 최선아;이형옥임형석
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.293-296
    • /
    • 1998
  • In this paper, we propose a matrix hypercube graph as a new topology for parallel computer and analyze its characteristics of the network parameters, such as degree, routing and diameter. N-dimensional matrix hypercube graph MH(2,n) contains 22n vertices and has relatively lower degree and smaller diameter than well-known hypercube graph. The matrix hypercube graph MH(2,n) and the hypercube graph Q2n have the same number of vertices. In terms of the network cost, defined as the product of the degree and diameter, the former has n2 while the latter has 4n2. In other words, it means that matrix hypercube graph MH(2,n) is better than hypercube graph Q2n with respect to the network cost.

  • PDF

Symmetry Analysis of Interconnection Networks and Impolementation of Drawing System (상호연결망의 대칭성분석 및 드로잉 시스템 구현)

  • Lee, Yun-Hui;Hong, Seok-Hui;Lee, Sang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1353-1362
    • /
    • 1999
  • 그래프 드로잉이란 추상적인 그래프를 시각적으로 구성하여 2차원 평면상에 그려주는 작업으로 대칭성은 그래프 드로잉시 고려해야 하는 미적 기준들 중에서 그래프의 구조 및 특성을 표현해주는 가장 중요한 기준이다. 그러나 일반 그래프에서 대칭성을 찾아 그려 주는 문제는 NP-hard로 증명이 되어 있기 때문에 현재까지는 트리, 외부평면 그래프, 직병렬 유향 그래프나 평면 그래프 등으로 대상을 한정시켜 연구가 진행되어 왔다. 본 논문에서는 병렬 컴퓨터나 컴퓨터 네트워크 구조를 가시화 시키기 위하여 많이 사용되는 그래프인 상호연결망(interconnection network)의 대칭성을 분석하고 분석된 대칭성을 최대로 보여주는 대칭 드로잉 알고리즘을 제안하였다. 그리고 이를 기반으로 하여 상호연결망의 기존 드로잉 방법들과 본 논문에서 제안한 대칭 드로잉 등 다양한 드로잉을 지원하는 WWW 기반의 상호연결망 드로잉 시스템을 구현하였다.Abstract Graph drawing is constructing a visually-informative drawing of an abstract graph. Symmetry is one of the most important aesthetic criteria that clearly reveals the structures and the properties of graphs. However, the problem of finding geometric symmetry in general graphs is NP-hard. So the previous work has focused on the subclasses of general graphs such as trees, outerplanar graphs, series-parallel digraphs and planar graphs.In this paper, we analyze the geometric symmetry on the various interconnection networks which have many applications in the design of computer networks, parallel computer architectures and other fields of computer science. Based on these analysis, we develope algorithms for constructing the drawings of interconnection networks which show the maximal symmetries.We also design and implement Interconnection Network Drawing System (INDS) on WWW which supports the various drawings including the conventional drawings and our suggested symmetric drawings.

Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks (하이퍼큐브형 상호연결망의 비쌍형 다대다 서로소인 경로 커버)

  • Park, Jung-Heum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.789-796
    • /
    • 2006
  • An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.

The Fibonacci Edge Labelings on Fibonacci Trees (피보나치트리에서 피보나치 에지 번호매김방법)

  • Kim, Yong-Seok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.437-450
    • /
    • 2009
  • In this paper, we propose seven edge labeling methods. The methods produce three case of edge labels-sets of Fibonacci numbers {$F_k|k\;{\geq}\;2$}, {$F_{2k}|k\;{\geq}\;1$} and {$F_{3k+2}|k\;{\geq}\;0$}. When a sort of interconnection network, the circulant graph is designed, these edge labels are used for its jump sequence. As a result, the degree is due to the edge labels.

Petersen-Torus(PT) Network for Multicomputing System (멀티컴퓨팅 시스템을 위한 피터슨-토러스(PT) 네트워크)

  • Seo, Jung-Hyun;Lee, Hyeong-Ok;Jang, Moon-Suk
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.6
    • /
    • pp.263-272
    • /
    • 2008
  • We propose and analyze a new interconnection network, called petersen-torus(PT) network based on well-known petersen graph. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same number of nodes. In this paper, we propose optimal routing algorithm and hamiltonian cycle algorithm. We derive diameter, network cost and bisection width.

Parallel Paths in Folded Hyper-Star Graph (Folded 하이퍼-스타 그래프의 병렬 경로)

  • Lee, Hyeong-Ok;Choi, Jung;Park, Seung-Bae;Cho, Chung-Ho;Lim, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1756-1769
    • /
    • 1999
  • Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

  • PDF

An Algorithm for One-to-One Mapping Matrix-star Graph into Transposition Graph (행렬-스타 그래프를 전위 그래프에 일-대-일 사상하는 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.5
    • /
    • pp.1110-1115
    • /
    • 2014
  • The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs

  • Chang, Jung-Hwan
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.75-84
    • /
    • 2011
  • The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

Embedding algorithm among star graph and pancake graph, bubblesort graph (스타 그래프와 팬케익, 버블정렬 그래프 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.5
    • /
    • pp.91-102
    • /
    • 2010
  • Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

  • PDF