• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.525-534
• /
• 2002

Race conditions, races in short, need to be detected for debugging parallel programs, because the races result in unintended non-deterministic executions. To detect the races in an execution of program, previous techniques use a centralized data structure which may incur serious bottleneck in generating concurrency information, or show inefficient time complexity which depends on the degree of nested parallelism in comparing any two of them. We propose a new labeling scheme in this paper, which is scalable in generating the concurrency information without bottleneck by using private data structure, and improves time complexity into constant in checking concurrency. The scalability and time efficiency therfore makes on-the-fly race detection efficient not only for programs with either shared-memory or message-passing, but also for programs with mixed model of the two.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.147-147
• /
• 2012

댐 및 제방 등의 수공구조물 붕괴에 의한 극한홍수 전파를 해석하기 위한 2차원 홍수 해석기법에는 현재까지 다양한 기법들이 개발되어 왔고 다양한 모형들이 상용화 또는 범용화 되고 있다. 그 중 흐름의 전파양상을 정확하게 반영할 수 있는 상류이송기법인 Godunov형태의 유한체적기법은 충격파와 같은 불연속적인 해를 가지는 문제를 정확히 해석할 수 있고, 비구조적 격자 사용의 용이성 등의 장점 때문에 2차원 홍수파 전파 해석에 있어서 최근 십수년간 가장 활발하게 연구되어왔다. 하지만 이러한 기법은 양해법을 근간으로 하는 해석 기법으로써, 계산거리의 간격이나 계산시간의 간격, 격자망의 구성 등 엄격한 제한이 필요하다. 특히 방대한 계산시간을 요구하는 기법의 약점은 홍수예 경보 등을 위한 실시간 모형의 구동에 있어서 큰 제약이 되어 왔다. CPU의 성능이 지속적으로 발전하면서 이러한 문제는 점차 극복되어 왔으나, 발열 등의 문제와 이를 극복하기 위한 멀티코어의 등장으로 인해 단일 코어의 성능개발은 매우 더딘 것이 사실이다. 현재까지 연구되고 개발되어 온 모형들은 특별한 처리 없이는 단일 코어만을 사용하여 계산할 수 밖에 없기 때문에 멀티코어의 장점을 전혀 이용할 수 없다. 이러한 점을 극복하기 위해 프로그램을 병렬화하여 단일 문제에 대해 멀티코어를 사용할 수 있다면 계산시간 단축에 큰 효과를 거둘 수 있을 것이다. 현재까지 IT분야에서 다양한 병렬프로그래밍 기법들이 개발되고 소개되어 왔다. 본 연구에서는 병렬프로그래밍 기법중 가장 널리 사용되고 있는 MPI(Message Passing Interface)기법을 적용함으로써 기 개발된 고정확도 유한체적모형을 병렬화 하여 계산시간을 단축하고자 하였다. 개발된 모형을 장애물이 존재하는 실험하도의 댐 붕괴 문제와 2002년 태풍 루사 시 큰 피해를 입은 강릉시 일원의 섬석천 유역에 위치한 장현저수지와 동막저수지의 붕괴사례에 대해 적용하였다. 모형을 코어 개수별로 다양하게 모의함으로써 기존모형과의 결과에 대한 일치성을 확인하였고, 기존 모형 대비 계산시간 단축의 효과를 입증할 수 있었다. 개발된 본 모형을 실시간 홍수범람해석을 위한 시스템으로 구축할 수 있다면, 실시간 홍수예 경보에 있어 주요지점에서의 수위해석 뿐만이 아닌 제내지 범람 예보 분야까지 확대 적용할 수 있을 것으로 사료된다.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.665-676
• /
• 2001

The most expensive spatial operation in patial database in a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisgying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved the response time is not tolerable because of not meeting the requiremetns of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. in spatial database the fixed grids which consist of the regularly partitioned cells can be employed the previous works on the spatial joins have not studied the parallel processing of spatial joins using fixed grids. This paper has presented an analytical cost model that estimates the comparative performance of a parallel spatial join algorithm based on the fixed grids in terms of the number of MBR comparisons. disk accesses, and message passing, Several experiments on the synthetic and real datasets show that the proposed analytical model is very accurate. This most model is also expected to used for implementing a very important DBMS component, Called the query processing optimizer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.700-707
• /
• 1999

본 논문에서는 GIS 관련 연산을 실시간에 효율적으로 처리하기 위한 분산공유메모리 기반 병렬처리 시스템을 제안한다. 본 논문의 분산공유메모리 시스템은 메시지전달 방식의 분산메모리 MIMD 컴퓨터 상에 소프트웨어 기반 분산공유메모리 모듈을 탑재함으로써 구현되었다. 또한 GIS 연산의 기본이 되는 공간 객체를 공유의 기본 단위로 설정하고, GIS 데이타의 특성을 반영하여 읽기전용 공유데이타 타입을 추가하였으며, 네트워크 오버헤드를 줄이기 위하여 복수의 객체를 한번에 읽어오는 bulk access가 가능하도록 하였다. 본 시스템에서는 GIS 데이타의 효율적인 분배를 위하여 부하균등화 기법으로 guided self scheduling을 사용하였다. 실험결과 본 시스템은 네트워크 캐쉬의 효율적인 활용을 통하여 소프트웨어 기반 분산메모리 시스템의 오버헤드에도 불구하고 MPI 기반 메시지전달 방식에 비하여 향상된 성능을 얻을 수 있었다.Abstract In this paper, we propose a distributed shared memory(DSM) based parallel processing system to process GIS related computations efficiently in real time. The system is based on a software DSM module implemented on top of a distributed MIMD computer. In the DSM system, spatial object, which is a fundamental structure to represent GIS data, is used as a basic unit for sharing, and a read-only shared data type is added to reflect the characteristics of GIS data. In addition, a bulk access to multiple shared data is made possible to reduce the network overhead. A guided self scheduling method is devised for efficient load balancing in distributing GIS data to parallel processors. The experimental results show that the DSM system performs better than an MPI based message-passing system through the efficient utilization of network cache in spite of the system's software overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.189-195
• /
• 2008

The OFDMA Physical layer in the WiMAX standard of IEEE 802.16e adopts 114 LDPC codes with various code rates and block sizes as a channel coding scheme to meet varying channel environments and different requirements for transmission performance. In this paper, the performances of the LDPC codes are evaluated according to various code rates and block-lengths throueh simulation studies using min-sum decoding algorithm in AWGN chamois. As the block-length increases and the code rate decreases, the BER performance improves. In the cases with code rates of 2/3 and 3/4, where two different codes ate specified for each code rate, the codes with code rates of 2/3A and 3/4B outperform those of 2/3B and 3/4A, respectively. Through the statistical analyses of the number of decoding iterations the decoding complexity and the word error rates of LDPC codes are estimated. The results can be used to trade-off between the performance and the complexity in designs of LDPC decoders.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.7-7
• /
• 2018

1차원 하수관로 해석 모형과 2차원 지표면 유출 해석 모형을 연계한 1D-2D 결합 도시침수 모델은 도시지역의 유출 현상과 침수 모의에 널리 이용되고 있다. 그러나 도시 지역의 복잡한 지형이 지표면 유출 흐름에 미치는 영향을 보다 자세히 파악하기 위해서는 보다 높은 해상도의 지형자료를 활용한 모의가 필요하다. 본 연구에서는 도시침수 해석을 위한 1D-2D 결합 하이브리드(Hybrid) 병렬화 코드(H12)를 개발하여 넓은 도시 유역에 대해서 고해상도 지형자료를 활용한 모의가 유역단위로 가능하도록 하였다. H12는 Open Multi-Processing(OpenMP)와 Message Passing Interface(MPI) 병렬 계산을 동시에 수행하여 매우 넓은 지역에 대해서도 도로의 형태를 확인 할 수 있는 수준의 고해상도 침수 해석 모의가 가능하다. 또한 도시지역의 복잡한 지형을 자세히 재현하고 계산의 효율을 높이기 위하여 격자세분화 기법이 적용되었다. H12의 적용성을 평가하기 위하여 미국 텍사스 알링턴 지역의 Johnson Creek 유역(${\sim}40km^2$)유역에 대한 시범 모의를 수행하였으며 도시유역의 지형을 표현하기 위하여 1m 해상도의 LiDAR자료를 사용하여 침수발생시 보다 자세한 유출수의 흐름을 해석할 수 있도록 하였다. 모의 결과 하이브리드 병렬 계산은 순차적 계산에 비하여 최고 79배 이상 빠른 계산속도 효율 향상을 보여주었으며, OpenMP나 MPI를 단독으로 사용하는 것에 비하여 더욱 효율적인 계산속도 효율 향상을 보여주었다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.119-131
• /
• 2009

Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.19 no.3
• /
• pp.164-173
• /
• 2017

Alternative cropping systems would be one of climate change adaptation options. Suitable areas for a crop could be identified using a climate suitability model. The EcoCrop model has been used to assess climate suitability of crops using monthly climate surfaces, e.g., the digital climate map at high spatial resolution. Still, a high-performance computing approach would be needed for assessment of climate suitability to take into account a complex terrain in Korea, which requires considerably large climate data sets. The objectives of this study were to implement a script for R, which is an open source statistics analysis platform, in order to use the EcoCrop model under a parallel computing environment and to assess climate suitability of maize using digital climate maps at high spatial resolution, e.g., 1 km. The total running time reduced as the number of CPU (Central Processing Unit) core increased although the speedup with increasing number of CPU cores was not linear. For example, the wall clock time for assessing climate suitability index at 1 km spatial resolution reduced by 90% with 16 CPU cores. However, it took about 1.5 time to compute climate suitability index compared with a theoretical time for the given number of CPU. Implementation of climate suitability assessment system based on the MPI (Message Passing Interface) would allow support for the digital climate map at ultra-high spatial resolution, e.g., 30m, which would help site-specific design of cropping system for climate change adaptation.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.71-80
• /
• 2001

Object-Oriented (OO) methodology to use the concept like encapsulation, inheritance, polymorphism, and message passing demands metrics that are different from structured methodology. There are many studies for OO software metrics such as program complexity or design metrics. But the metrics for the analysis class need to decrease the complexity in the analysis phase so that greatly reduce the effort and the cost of system development. In this paper, we propose new metrics to measure the complexity of analysis classes which draw out in the analysis phase based on Unified Process. By the collaboration complexity, is denoted by CC, we mean the maximum number of the collaborations can be achieved with each of the collaborator and detennine the potential complexity. And the interface complexity, is denoted by IC, shows the difficulty related to understand the interface of collaborators each other. We prove mathematically that the suggested metrics satisfy OO characteristics such as class size and inheritance. And we verify it theoretically for Weyuker' s nine properties. Moreover, we show the computation results for analysis classes of the system which automatically respond to questions of the it's user using the text mining technique. As we compared CC and IC to CBO and WMC, the complexity can be represented by CC and IC more than CBO and WMC. We expect to develop the cost-effective OO software by reviewing the complexity of analysis classes in the first stage of SDLC (Software Development Life Cycle).

• Journal of the Society of Naval Architects of Korea
• /
• v.47 no.4
• /
• pp.628-645
• /
• 2010

To perform the engagement level simulation between the underwater vehicle model and the surface model those are constituted with various systems/ sub-systems, we implemented four different federates as a federation according to the IEEE 1516 HLA (High Level Architecture) protocol that is the international standard in the distributed simulation. Those are CFCS (Command and Fire Control System) federate, motion federate, external entities (torpedos, countermeasure and surfaceship) federate, and visualization federate that interacts with OSG (Open Scene Graph)-based visualization rendering module. In this paper, we present the detailed method about the model constitution for discrete event simulation in the distributed environment. For the sake of this purpose, we introduce the DEVS (Discrete Event System Specification)-HLA-based modeling method of the CFCS federate that reflects not only the interations between models, but also commands from user and tactics manager that is separated from the model. The CFCS federate makes decisions in various missions such as the normal diving, the barrier misision, the target motion analysis, the torpedo launch, and the torpedo evasion. In the perspective of DEVS modeling, the CFCS federate is the coupled model that has the tactical data process model, command model and fire control model as an atomic model. The message passing and time synchronization with other three federates are settled by the $m\ddot{a}k$ RTI (Runtime Infrastructure) that supports IEEE 1516. In this paper, we provides the detailed modeling method of the complicated model that has hierarchical relationship such as the CFCS system in the submarine and that satisfies both of DEVS modeling method for the discrete event simulation and HLA modeling method for the distributed simulation.