• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.27-36
• /
• 1993

This paper proposes a shortest path allocation algorithm over the processors on the hypercube system based on the message passing techniques with the optimized module allocation. On multiprocessor systems, how to divide one task into multiple tasks efficiently is an important issue due to the hardness of the life cycle estimation of each process. To solve the life cycle discrepancies, the appropriate task assignment to each processor and the flexible communications among the processors are indispensible. With the concurrent program execution on hypercube systems, each process communicaties to others with the method of message passing. And, each processor has its own memory. The proposed algorithm generates a callable tree out of the module, assigns the weight factors, constructs the allocation graph, finds the shortest path allocation tree, and maps them with hypercube.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.153-162
• /
• 1995

When vector quantization is used in low rate image coding (e.g., R<0.5), the primary problem is the tremendous computational complexity which is required to search the whole codebook to find the closest codevector to an input vector. Since the number of code vectors in a vector quantizer is given by an exponential function of the dimension. i.e., L=2$^{nR}$ where Rn. To alleviate this problem, a multiple shell structure of hypercube feature maps (MSSHFM) is proposed. A binary HFM of k-dimension is composed of nodes at hypercube vertices and a multiple shell architecture is constructed by surrounding the k-dimensional hfm with a (k+1)-dimensional HFM. Such a multiple shell construction of nodes inherently has a complete tree structure in it and an efficient partial search scheme can be applied with drastically reduced computational complexity, computer simulations of still image coding were conducted and the validity of the proposed method has been verified.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.111-114
• /
• 2010

스타 그래프, 버블정렬 그래프, 팬케익 그래프는 노드 대칭성(node symmetric), 최대 고장 허용도(maximum fault tolerance), 계층적 분할 성질을 갖고, 하이퍼큐브보다 망비용이 개선된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타 그래프와 그의 변형된 그래프들 사이의 임베딩 방법을 제안하고, 임베딩 비용을 분석한다. 임베딩 결과는 버블정렬 그래프는 스타 그래프에 연장율(dilation) 3, 스타그래프는 팬케익 그래프에 연장율 4로 각각 임베딩 가능하다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.597-600
• /
• 2008

스타(star) 네트워크는 노드 대칭성, 최대 고장 허용도, 계층적 분할 성질을 갖고, 하이퍼큐브보다 망 비용이 개선 된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타네트워크와 RFM, 버블정렬네트워크 사이의 임베딩 방법을 제안하고, 임베딩의 연장율 비용을 분석한다. 연구 결과로 버블정렬(Bubblesort) 그래프 $B_N$을 RFM 그래프 $R_N$에 연장비율 2, 버블정렬(Bubblesort) 그래프 $B_N$을 스타그래프 $S_N$에 연장율 3에 임베딩 할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.671-674
• /
• 2007

전위그래프는 스타 그래프와 그의 변형 그래프를 포함할 수 있는 일반화된 그래프이다. RFM 그래프는 스타 그래프가 갖는 좋은 성질을 가지면서 하이퍼큐브보다 망 비용이 적은 값을 갖는 상호연결망이다. 본 논문에서는 그래프의 에지 정의를 이용하여 전위그래프와 RFM그래프 사이의 노드를 일-대-일 사상하는 방법을 제시한다. 이러한 사상 결과를 통해 전위그래프는 RFM그래프에 연장율 4, 확장율 1에 임베딩 가능하고, RFM그래프는 전위그래프에 O(n)에 임베딩 가능하다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.659-662
• /
• 2007

알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

• Journal of the Society of Disaster Information
• /
• v.17 no.4
• /
• pp.747-754
• /
• 2021

Purpose: Seismic safety evaluation of a curved bridge must be performed since the curved bridges exhibit the complex behavior rather than the straight bridges, due to geometrical characteristics. In order to conduct the probabilistic seismic assessment of the curved bridge, Seismic fragility evaluation was performed using the uncertainty of the steel material properties of a curved bridge girde, in this study. Method: The finite element (FE) model using ABAQUS platform of the curved bridge girder was constructed, and the statistical parameters of steel materials presented in previous studies were used. 100 steel material models were sampled using the Latin Hypercube Sampling method. As an input ground motion in this study, seismic fragility evaluation was performed by the normalized scale of the Gyeongju earthquake to 0.2g, 0.5g, 0.8g, 1.2g, and 1.5g. Result: As a result of the seismic fragility evaluation of the curved girder, it was found that there was no failure up to 0.03g corresponding to the limit state of allowable stress design, but the failure was started from 0.11g associated with using limit state design. Conclusion: In this study, seismic fragility evaluation was performed considering steel materials uncertainties. Further it must be considered the seismic fragility of the curved bridge using both the uncertainties of input motions and material properties.

• The Journal of Society for e-Business Studies
• /
• v.18 no.2
• /
• pp.153-173
• /
• 2013

The ontology has been gaining increasing interests by recent arise of the semantic web and related technologies. The focus is mostly on inference query processing that requires high-level techniques for storage and searching ontologies efficiently, and it has been actively studied in the area of semantic-based searching. W3C's recommendation is to use RDFS and OWL for representing ontologies. However memory-based editors, inference engines, and triple storages all store ontology as a simple set of triplets. Naturally the performance is limited, especially when a large-scale ontology needs to be processed. A variety of researches on proposing algorithms for efficient inference query processing has been conducted, and many of them are based on using proven relational database technology. However, none of them had been successful in obtaining the complete set of inference results which reflects the five characteristics of the ontology properties. In this paper, we propose a new index structure called hyper cube index to efficiently process inference queries. Our approach is based on an intuition that an index can speed up the query processing when extensive inferencing is required.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3088-3098
• /
• 1998

The arrangement graph, which is a viable interconnection scheme for parallel and distributed systems, has been proposed as an attactive altemative to the n-cube. However, A fault tolerant design model which is well suitable for the arrangement graph doesn't has been proposd until recently, but fault tolerant design modelsfor many schemes have been proposed ina large number of paper. So, our paper presents a new fault tolerant design technique suited for the arrangement graph. To maintains the previous structures when it ocurs a fault in the current processing, the scheme properly sugbstitutes a fault-componnent into the existing structures by adding a spare component. the first of all, it converts arrangement graph into a circulant graph using the hamiltonian property and then uses automorphism of circulant graph to tolerate faults. Also, We optimize the cost of rate fault tolerant architectures by adding exactly k spare processor while tolerating up to k processor and minimizing the maximum number of limks per processor. Specially, we proposes a new techniue to minimize the maximum number of links.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.766-780
• /
• 1996

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph. One of them is especially suitable for real-time applications of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the problem graph are weighted and the actual distance rather than the nominal distance for the edges in the system graph is employed. This facilitates a more accurate qualification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed: initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.