• Annual Conference of KIPS
• /
• 2016.10a
• /
• pp.56-57
• /
• 2016

본 논문에서는 클러스터 컴퓨팅 환경에서 가용한 자원의 추이를 고려한 자원 스케줄링 최적화 방법을 제안한다. 제안하는 스케줄링 방법은 데이터 인텐시브 응용의 특성인 자원 추가에 따른 처리 성능의 선형적 확장성을 활용하는데, 사용자가 작업 수행을 위해 명시한 자원이 가용하지 않은 경우에 해당 자원이 가용해질 때까지 기다리는 것이 아니라 가용한 자원 상황 추이를 고려하여 융통성 있는 자원 할당을 하게 함으로써 자원 조각화를 최소화한다. 시물레이션을 통한 실험으로 제안하는 방법이 기존 방법에 비해 자원 활용률과 처리량 측면에서 우수함을 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.547-547
• /
• 2000

Recently, due to the advance of computer, network and Internet technology, control/monitoring systems are required to process the massive data, At the same time, the software development environment uses more and more component-based methodology. This paper proposes the services for the control /monitoring domain. Especially we define domain-specific interfaces and categories to acquire compatibility between products, and implement architecture for lightweight event service. As it is very important to support compatibility between heterogeneous systems, the proposed system provides modules for the web service and communication protocols based on the XML. And as proposed architecture consists of cluster of servers and Windows 2000's NLB service, it can guarantee more stable operation,

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.147-154
• /
• 2008

First, this paper compute difference value between frames using the composed method of $X^2$ histogram and color histogram and the normalization. Next, cluster representative frame was decided by using the clustering for distance and the k-mean grouping. Finally, representative frame of group was decided by using the likelihood ratio. Proposed method can be known by experiment as outstanding of detection rather than other methods, due to computing of difference value, clustering and grouping, and detecting of representative frame.

• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.319-322
• /
• 2002

최근 주목받고 있는 그리드 컴퓨팅 연구등에 주요한 요소로서 기대되어지는 고성능 클러스터 시스템들은 주로 과학 기술 응용연구를 위해 사용되어진다. 이러한 종류의 병렬 시스템은 특정 부품들을 사용하는데 그중 네트워크를 구성하는 부품들이 통상의 분산/병렬컴퓨팅에 주요한 역할요소로서 주목을 받아오고 있다. 이 논문에서는 myrinet, Gbit ethernet, Fast ethernet 장비에 대하여 각각 Netpipe, Linpack, NPB 등의 벤치마크를, 성능 실험을 동해 선정한 Pentium IV 1.7Mhz/1Gb Mem 16노드로 구성한 클러스터에 대하여 2종의 컴파일러를 사용하여 테스트하고 그 결과를 분서하였다. 상이한 성능 차를 보이는 장비간의 성능 비교를 통해 2002년 2월 현재 가능한 응용문제가 사용하고 있는 알고리즘에 따른 최적의 클러스터 시스템의 최적 구성을 도출 할 수 있다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.10 s.253
• /
• pp.1320-1327
• /
• 2006

Parallel procedure and performance of two-step Eulerian code have not been reported sufficiently yet even though it was developed and utilized widely in the impact simulation. In this study, parallel strategy of two-step Eulerian code was proposed and described in detail. The performance was evaluated in the self-made linux cluster computer. Compared with commercial code, a relatively good performance is achieved. Through the performance evaluation of each computation stage, remap is turned out to be the most time consuming part among the other part such as FE processing, communication, time marching etc.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.923-929
• /
• 2002

We discuss scheduling analysis for a discrete event system with time windows of which firing or holding time delays are subject to random variation within some finite range. To do this, we propose a modified p-lime Petri net, named p+-time Petri net. We develop a condition for which a synchronized transition does not have a dead token, that is, the firing epochs do not violate the time window constraints. We propose a method of computing the feasible range of the token sojourn time at each place based on a time difference graph. We also discuss an application for analyzing wafer residency times within the process chambers for a dual-armed cluster tool for chemical vapor deposition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.376-377
• /
• 2016

Performance of Hadoop, which is a distributed data processing framework for big data analysis, is affected by several characteristics of each node in distributed cluster such as processing power and network bandwidth. This paper analyzes previous approaches for heterogeneous hadoop clusters, and presents several requirements for distributed node clustering in small-and-medium sized hospitals by considering computing environments of the hospitals.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.05a
• /
• pp.152-157
• /
• 2002

전산유체역학분야의 고속 연산을 위해서 병렬처리가 보편화되고 있으며 이러한 병렬해석은 주로 클러스터에서 저렴한 비용으로 수행되고 있다. 전산유체역학을 위한 클러스터 컴퓨터에서의 해석프로그램의 성능은 클러스터에 사용되는 프로세서의 성능뿐만 아니라 클러스터 내부의 통신 장비의 성능에 크게 좌우된다. 본 논문에서는 클러스터 컴퓨터의 구축에 널리 사용되고 있는 Myrinet2000, Gigabit Ethernet, Fast Ethernet 등의 네트웍 장치에 대해서 Netpipe, Linpack, NAS NPB, 그리고 MPINS2D Navier-Stokes 해석프로그램을 사용하여 성능을 비교하였다. 이를 통해서 향후 전산유체역학을 위한 클러스터 구축시 최대의 가격대 성능비를 얻을 수 있는 방법을 제시하고자 한다.

• Journal of Applied Reliability
• /
• v.6 no.4
• /
• pp.297-306
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.209-215
• /
• 2015

Fuzzy c-means method is typical soft clustering, and requires a degree of membership that indicates the degree of belonging to each cluster at the time of clustering. Parameter values greater than 1 and less than 2 have been used by convention. According to the proposed data-generation scheme and the simulation results, some behaviors in the degree of "fuzziness" was derived.