• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• Journal of Environmental Science International
• /
• v.27 no.8
• /
• pp.723-735
• /
• 2018

In this study, to investigate an optimal configuration method for the modeling system, we performed an optimization experiment by controlling the types of compilers and libraries, and the number of CPU cores because it was important to provide reliable model data very quickly for the national air quality forecast. We were made up the optimization experiment of twelve according to compilers (PGI and Intel), MPIs (mvapich-2.0, mvapich-2.2, and mpich-3.2) and NetCDF (NetCDF-3.6.3 and NetCDF-4.1.3) and performed wall clock time measurement for the WRF and CMAQ models based on the built computing resources. In the result of the experiment according to the compiler and library type, the performance of the WRF (30 min 30 s) and CMAQ (47 min 22 s) was best when the combination of Intel complier, mavapich-2.0, and NetCDF-3.6.3 was applied. Additionally, in a result of optimization by the number of CPU cores, the WRF model was best performed with 140 cores (five calculation servers), and the CMAQ model with 120 cores (five calculation servers). While the WRF model demonstrated obvious differences depending on the number of CPU cores rather than the types of compilers and libraries, CMAQ model demonstrated the biggest differences on the combination of compilers and libraries.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.257-267
• /
• 2017

Compressed Sensing(CS) deals with linear inverse problems. The theoretical results of CS have had an impact on inference problems and presented amazing research achievements in the related fields including signal processing and information theory. However, in order for CS to be applied in practical environments, there are two significant challenges to be solved. One is to guarantee in real time recovery of CS signals, and the other is that the signals have to be sparse. To this end, the latest researches using deep learning technology have emerged. In this paper, we consider CS problems based on deep learning and discuss the latest research results. And the approaches for CS signal reconstruction using deep learning show superior results in terms of recovery time and performance. It is expected that the approaches for CS reconstruction using deep learning shown in recent studies can not only raise the possibility of utilization of CS, but also be highly exploited in the fields of signal processing and communication areas.

• The Journal of the Korea Contents Association
• /
• v.14 no.5
• /
• pp.8-17
• /
• 2014

Petascale systems(so called supercomputers) have been mainly used for supporting communication-intensive and tightly-coupled parallel computations based on message passing interfaces such as MPI(HPC: High-Performance Computing). On the other hand, computing paradigms such as High-Throughput Computing(HTC) mainly target compute-intensive (relatively low I/O requirements) applications consisting of many loosely-coupled tasks(there is no communication needed between them). In Korea, recently emerging applications from various scientific fields such as pharmaceutical domain, high-energy physics, and nuclear physics require a very large amount of computing power that cannot be supported by a single type of computing resources. In this paper, we present our HTCaaS(High-Throughput Computing as a Service) which can leverage national distributed computing resources in Korea to support these challenging HTC applications and describe the details of our system architecture, job execution scenario and case studies of various scientific applications.

• Journal of Korean Society for Atmospheric Environment
• /
• v.21 no.6
• /
• pp.573-583
• /
• 2005

Fugitive dust, which is emitted in the ambient air without first passing through a stack or duct designed to control flow, is frequently generated by means of wind erosion from storage yards at Pohang Steel Wokrs. The size distribution of fugitive dust is mostly in the range of coarse particulate which is deposited as soon as emitted and less harm to human health; however $20\%$ of fugitive dust contains PM 10 known as one of most harmful airborne pollutant. Consequently, effective control and reduction of fugitive dust is strongly requested by the local society, but it is not easy so far because the generation and dispersion of fugitive dust highly depends on meteorological conditions, and it being occurred for irregularity. This research presented a fugitive dust control system for each meteorological condition by providing statistical prediction data obtained from a statistical analysis on the probability of generating the threshold velocity at which the fugitive dust begins to occur, and the frequency occurring by season and by time of the wind direction that can generate atmospheric pollution when the dispersed dust spreads to adjacent residential areas. The research also built a fugitive dust detection system which monitors the weather conditions surrounding storage yards and the changes in air quality on a real-time basis and issues a warning message by identifying a situation where the fugitive dust disperses outside the site boundary line so that appropriate measures can be taken on a timely basis. Furthermore, in respect to the spraying of water to prevent the generation of fugitive dust from the storage piles at the storage yard, an advanced statistical meteorological analysis on the weather conditions in Pohang area and a case study of fugitive dust dispersion toward outside of working field during $2002\∼2003$ were carried out in order to decide an optimal water-spraying time and the number of spraying that can prevent the origin of fugitive dust emission. The results of this research are expected to create extremely significant effects in improving surrounding environment through actual reduction of the fugitive dust produced from the storage yard of Pohang Steel Works by providing a high-tech warning system capable of constantly monitoring the leakage of fugitive dust and water-spray guidance that can maximize the water-spraying effects.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.6
• /
• pp.8-16
• /
• 2003

Aerodynamic characteristics over Micro Aerial Vehicle(MAV) in low Reynolds number regime are numerically studied using 3-D unsteady, incompressible Navier-Stokes flow solver with single partitioning method for multi-block grid. For more efficient computation of unsteady flows, this flow solver is parallel-implemented with MPl(Message Passing Interface) programming method. Firstly, MAV wing with not complex geometry is considered and then, we analyze aerodynamic characteristics over full MAV configuration varying the angle of attack. Present computational results show a better agreement with the experimental data by MACDL(Micro Aerodynamic Control and Design Lab.), Seoul National University. We can also find the conceptually designed MAV by MACDL has the static stability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.795-805
• /
• 2012

This paper proposes an algorithm and a hardware architecture for a broadcast communication which has the worst bottleneck among multiprocessor using distributed memory architectures. In conventional system, The pipelined broadcast algorithm is an algorithm which takes advantage of maximum bandwidth of communication bus. But unnecessary synchronization process are repeated, because the pipelined broadcast sends the data divided into many parts. In this paper, the MPI unit for pipeline chain algorithm based on circuit switching removing the redundancy of synchronization process was designed, the proposed architecture was evaluated by modeling it with systemC. Consequently, the performance of the proposed architecture was highly improved for broadcast communication up to 3.3 times that of systems using conventional pipelined broadcast algorithm, it can almost take advantage of the maximum bandwidth of transmission bus. Then, it was implemented with VerilogHDL, synthesized with TSMC 0.18um library and implemented into a chip. The area of synthesis results occupied 4,700 gates(2 input NAND gate) and utilization of total area is 2.4%. The proposed architecture achieves improvement in total performance of MPSoC occupying relatively small area.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.181-189
• /
• 2001

The software components of embedded control systems get extremely complex as they are designed into distributed systems get extremely complex as they are designed into distributed systems consisting of a large number of inexpensive microcontrollers interconnected by low-bandwidth real-time networks such as the controller area network (CAN). While recently emerging middleware technologies such as CORBA and DCOM address the complexity of distributed programming, they cannot be directly applied to distributed control system design due to their excessive resource demand and inadequate communication models. In this paper, we propose a CORBA-based middleware design for CAN-based distributed embedded control systems. Our design goal is to minimize its resource need and make it support group communication without losing the IDL (interface definition language) level compliance to the OMG standards. To achieve this, we develop a transport protocol on the CAN and a group communication scheme based on the well-known publisher/subscriber model. The protocol effectively realizes subject-based addressing and supports anonymous publisher/subscriber communication. We also customize the method invocation and message passing protocol, referred to as the general inter-ORB protocol (GIOP), of CORBA so that CORBA method invocations are efficiently serviced on a low-bandwidth network such as the CAN. This customization includes packed data encoding and variable-length integer encoding for compact representation of IDL data types. We have implemented our CORBA-based middleware on the mArx real-time operating system we have developed at Seoul National University. Our experiments clearly demonstrate that it is feasible to use CORBA in developing distributed embedded control systems possessing severe resource limitations. Our design clearly demonstrates that it is feasible to use a CORBA-based middleware in developing distributed embedded systems on real-time networks possessing severe resource limitations.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.92-100
• /
• 2009

In this paper, we analyze the hardware architecture of Low Density Parity Check (LDPC) decoder using Log Likelihood Ration-Belief Propagation (LLR-BP) decoding algorithm. Various design issues that affect the decoding performance and the hardware complexity are discussed and the tradeoffs between the hardware complexity and the performance are analyzed. The message data for passing error probability is quantized to 7 bits and among them the fractional part is 4 bits. To maintain the decoding performance, the integer and fractional parts for the intrinsic information is 2 bits and 4 bits respectively. We discuss the alternate implementation of $\Psi$(x) function using piecewise linear approximation. Also, we improve the hardware complexity and the decoding time by applying overlapped scheduling.

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.110-115
• /
• 2010

Recently the deeply underground tunnels have been increased along the subway railroads of urban area compared to the past subway railroads. The Shin-Gum-Ho subway station (the Fifth lines, the depth : 46m) which is the third among the deep subway stations in the Korea was chosen as the model of deeply underground stations, and attempted to do simulation of fire. This station consists of three entrance, the basement first floor (B1), the basement second floor (B2), the basement eighth floor or platform (B8) and escalators and stairs from B2 to B8. The total number of grid was about 9,000,000 to make simulation of fire and smoke from the platform to entrance in this research, and the grid system was divided into 19 blocks to increase the efficiency of this simulation. The FDS (Fire Dynamics Simulation) was chosen to make the simulation of fire, and the model of turbulent flow was LES (Large Eddy Simulation). Each block is processed in a CPU using parallel processing of MPI (Message Passing Interface). The resource of CPU for this simulation is a ten of Intel 3.0 GHz Dual CPU (20 CPU).