• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.878-880
• /
• 2003

대부분의 진단 알고리즘은 PMC 모델을 바탕으로 결함의 개수가 t개를 초과하지 않는다는 t-진단가능 시스템의 특성을 이용한다. 하지만, 병렬처리 시스템의 규모가 커짐에 따라 시스템 내에서 발생되는 결함의 빈도가 높아지게 된다. 즉, 진단 알고리즘에서 가정하는 결함의 개수 t는 병렬처리 시스템 안에 있는 노드의 수에 비해 상당히 작은 개수이며, 결함의 개수가 t를 초과할 경우는 거의 고려하지 않았다. 본 논문에서는 결함의 개수가 t개를 초과하는 경우에 대하여 진단의 정확여부를 판단할 수 없는 충분히 작은 개수의 노드가 존재한다는 것을 허락함으로서, 진단 가능한 결함의 최대 수를 증가시키는 알고리즘을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.1-9
• /
• 1993

In this paper, we develop enhanced hypercube architectures and routing algorithms to realize arbitrary permutations in circuit switching. We prove that a hypercube is rearrangeable if one additional pair of links (one full-duplex communication line) is provided in only one dimesion of connections. We also prove that if each connection between two neighboring nodes consists of two pairs of links, the hypercube can handle two independent permutations simultaneously.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.1-10
• /
• 1994

In this paper, we propose a processor allocation algorithm using the PGG(Packed Gray code Group) for the MIMD hypercube. The number of k-D subcubes in an n-cube is C(n.k) en-k. When the PGG is employed in the processor allocation, C(n, k) PGG's are required to recognize all the k-D subcubes in an n-cube. from the simulation we find that the capability of processor allocation using only 40% of C(n, k) PGG's is about the same as that of the allocation using all the PGG's.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.718-720
• /
• 2001

본 논문에서는 하이퍼큐브보다 망 비용이 개선된 상호연결망 HCN(n,n)의 임의의 두 노드간에 노드중복하지 않는 n+1개의 병렬경로를 구성하는 방법을 제시하고, 그 결과를 통하여 HCN(n,n)의 고장지름이 dia(HCN(n,n))+4 이하임을 보인다. 이러한 병렬경로는 노드간에 메시지를 전송하는 시간을 줄일 수 있으며, HCN(n,n)의 노드 몇 개가 고장이 발생해도 통신지연시간이 발생하지 않음을 의미한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.335-343
• /
• 2009

The crossed cube has received great attention because it has equal or superior properties compared to the hypercube that is widely known as a versatile parallel processing system. It has been known that disjoint two copies of a mesh of size $4{\times}2^m$ or disjoint four copies of a mesh of size $8{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 [Dong, Yang, Zhao, and Tang, 2008]. However, it is not known that disjoint multiple copies of a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1 and expansion 1. In this paper, we show that disjoint $2^{n-1}$ copies of a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 where $n{\geq}1$ and $m{\geq}3$. Our result is optimal in terms of dilation and expansion that are important measures of graph embedding. In addition, our result is practically usable in allocating multiple jobs of mesh structure on a parallel computer of crossed cube structure.

• Journal of KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.1-9
• /
• 2005

In this paper we propose a modified fuzzy min-max neural network model for pattern classification and discuss the usefulness of the model. We define a new hypercube membership function which has a weight factor to each of the feature within a hyperbox. The weight factor makes it possible to consider the degree of relevance of each feature to a class during the classification process. Based on the proposed model, a knowledge extraction method is presented. In this method, a list of relevant features for a given class is extracted from the trained network using the hyperbox membership functions and connection weights. Ft)r this purpose we define a Relevance Factor that represents a degree of relevance of a feature to the given class and a similarity measure between fuzzy membership functions of the hyperboxes. Experimental results for the proposed methods and discussions are presented for the evaluation of the effectiveness and feasibility of the proposed methods.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.2
• /
• pp.115-124
• /
• 2014

Hypercube and star graph are widely known as interconnection network. The embedding of an interconnection network is a mapping of a network G into other network H. The possibility of embedding interconnection network G into H with a low cost, has an advantage of efficient algorithms usage in network H, which was developed in network G. In this paper, we provide an embedding algorithm between HCN and HON. HCN(n,n) can be embedded into HON($C_{n+1},C_{n+1}$) with dilation 3 and HON($C_d,C_d$) can be embedded into HCN(2d-1,2d-1) with dilation O(d). Also, star graph can be embedded to half pancake's value of dilation 11, expansion 1, and average dilation 8. Thus, the result means that various algorithms designed for HCN and Star graph can be efficiently executed on HON and half pancake, respectively.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.556-564
• /
• 2003

A Star and Pancake graph also have such a good property of a hypercube and have a low network cost than the hypercube. A Macro-star graph which has the star graph as a basic module has the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. And, it is an interconnection network which improves the network cost against the Star graph. In this paper, we propose a method to embed between Star graph, Pancake graph, and Macro-star graph using the edge definition of graphs. We prove that the Star graph $S_n$ can be embedded into Pancake graph $P_n$ with dilation 4, and Macro-star graph MS(2,n) can be embedded into Pancake graph $P_{2n＋1}$ with dilation 4. Also, we have a result that the embedding cost, a Pancake graph can be embedded into Star and Macro-star graph, is O(n).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.35-44
• /
• 2005

This paper proposes an efficient heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from all neighbor processors. However, real load transfer is collectively done after all load traffic is calculated. This prevents useless traffic and thus reduces the overall load traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to hypercube, mesh, k-ary n-cube and general graph environments. For performance evaluation, simulation studies are performed. The proposed algorithm and the well-known existing algorithms are implemented and compared. The results show that the proposed algorithm always balances the loads perfectly. furthermore, in comparison with the existing algorithms, it reduces the communication costs by 77%, 74% and 73% in the hypercube, the mesh, and k-ary n-cube, respectively.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.6
• /
• pp.262-274
• /
• 2019

The purpose of this study is to estimate the minimum proportion of probe vehicles for obtaining expressway traffic information using VISSIM, a micro traffic simulation model, between Yongin IC and Yangji IC on Yeongdong Expressway. 7,200 scenarios were created for the experiment, and 40 scenarios were adopted using the Latin hypercube sampling method because it was difficult to perform all the scenarios through experiments. The reliability of the experiment was improved by adding a situation when the general situation and the accident situation exist. In the experiments, the average travel time of probe vehicles at different market penetration rates were compared with the average travel time of the entire vehicles. As a result, the minimum market penetration rate of probe vehicles for obtaining expressway traffic information was found to be 45%. In addition, it is estimated that 25% market penetration rate of probe vehicle can meet 70% of traffic situations in accident scenario.