• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.1
• /
• pp.174-182
• /
• 2014

Recently, not only common types of hybrid electric vehicle (HEV) such as series or parallel but many other types of HEVs including 4WD hybrid electric vehicle have been developed and released. In this study, analysis of fuel economy and driving performance for 2WD and 4WD HEV are conducted using backward simulation based on dynamic programming. To analyze the characteristics of 4WD HEV, tire slip model based on vehicle dynamics was applied to the backward simulation program. As a result, 2WD HEV shows better fuel economy than 4WD HEV because of relatively simple configuration. However, in a severe road condition, 4WD HEV shows better driving performance that 2WD HEV had about 6% of impossible time to follow the driving cycle though the 4WD HEV had no impossible time.

• Geophysics and Geophysical Exploration
• /
• v.20 no.2
• /
• pp.72-77
• /
• 2017

We calculated 3D frequency- and Laplace-domain wavefields using time-domain modeling and Fourier transform or Laplace transform. We adopted OpenACC and GPU for an efficient parallel calculation. The OpenACC makes it easy to use GPU accelerators by adding directives in conventional C, C++, and Fortran programming languages. Accordingly, one doesn't have to learn new GPGPU programming languages such as CUDA or OpenCL to use GPU. An OpenACC program allocates GPU memory, transfers data between the host CPU and GPU devices and performs GPU operations automatically or following user-defined directives. We compared performance of 3D wave propagation modeling programs using OpenACC and GPU to that using single-core CPU through numerical tests. Results using a homogeneous model and the SEG/EAGE salt model show that the OpenACC programs are approximately 53 and 30 times faster than those using single-core CPU.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.123-131
• /
• 1999

In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.72-79
• /
• 2011

The importance of parallel programming seriously emerges ever since the modern microprocessor architecture has been shifted to the multi-core system. Transactional Memory has been proposed to address synchronization which is usually implemented by using locks. However, the lock based synchronization method reduces the parallelism and has the possibility of causing deadlock. In this paper, we propose an efficient method to utilize transactional memory for the situation which has high contention. The proposed idea is based on the theoretical analysis and it is verified with simulation results. The simulation environment has been implemented using HTM(Hardware Transactional Memory) systems. We also propose a model of the dining philosopher problem to discuss the efficient resource management using the transactional memory technique.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.831-845
• /
• 1997

In this paper,we proposed and developed a compiler and interactive programming enviroments for C++ wich is mostly worth of nitice among the object -oriented languages.To develope the compiler for C++ we took front=end/back-end model using EM virtual machine.In develpoing Front-End,we formailized C++ gram-mar with the context semsitive tokens which must be manipulated by dexical scanner and designed a AST class li-brary which is the hierarchy of AST node class and well defined interface among them,In develpoing Bacik-End,we proposed model for three major components :code oprtimizer,code generator and run-time enviroments.We emphasized the retargatable back-end which can be systrmatically reconfigured to genrate code for a variety of distinct target computers.We also developed terr pattern matching algorithm and implemented target code gen-erator which produce SPARC code.We also proposed the theroy and model for construction interative pro-gramming enviroments. To represent language features we adopt AST as internal reprsentation and propose uncremental analysis algorithm and viseal digrams.We also studied unparsing scheme, visual diagram,graphical user interface to generate interactive environments automatically Results of our resarch will be very useful for developing a complier and programming environments, and also can be used in compilers for parallel and distributed enviroments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.7
• /
• pp.751-756
• /
• 2014

The dynamic behavior of numerous grains interacting with each other can be easily observed. In this study, this dynamic behavior was analyzed based on the contact between numerous grains. The discrete element method was used for analyzing the dynamic behavior of each particle and the neighboring-cell algorithm was employed for detecting their contact. The Hertzian and tangential sliding friction contact models were used for calculating the contact force acting between the particles. A GPU-based parallel program was developed for conducting the computer simulation and calculating the numerous contacts. The dam break experiment was performed to verify the simulation results. The reliability of the program was verified by comparing the results of the simulation with those of the experiment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.531-535
• /
• 2008

최근의 융합학문의 발전으로 생물, 물리, 화학, 천문, 우주학, 지구과학 분야에서도 병렬 프로그램을 이용한 대용량 데이터를 처리하는 빈도가 높아졌다. 그러나 병렬 프로그래밍은 병렬환경의 전문성을 가지고 있지 않는 다른 학문의 전문가가 사용하기는 어려운 것이 현실이다. 이에 본 논문에서는 병렬환경의 비전문가도 사용하기 용이한 관심 지향적 병렬 프로그래밍 모델과 자바 기반으로 구현된 AspectHPJ 시스템을 제안한다. 본 시스템의 첫 번째 특징은 일반사용자가 Sequential 코드로 프로그램을 작성하고 병렬화 하고자 하는 코드영역에 병렬마크를 사용하여 병렬코드로 전환하는 특징을 가지고 있다. 두 번째는 병렬환경 요소 (프로세서 개수, 분산배열 속성)를 AOP 개념의 관심 (aspect)으로 추출하여 사용자가 보다 용이하게 병렬환경 요소를 설정할 수 있게 해주는데 있다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.12
• /
• pp.1150-1159
• /
• 2011

Reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure. Reliability-Redundancy Optimization Problem(RROP) involves selection of components with multiple choices, redundancy levels and redundancy strategy(Active or Standby) for maximizing system reliability with constraints such as cost, weight, etc. Based on the design configuration of Multi-Spectral Camera(MSC) system of KOMPSAT-2, the mathematical programming model for RROP is suggested in this study. Due to the nature of RROP, i.e. NP-hard problem, Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve it. The result of the numerical experiment for RROP is presented as instance of recommended design configuration at some mission time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.79-84
• /
• 2023

Apache Spark, which provides the fastest processing speed among recent distributed and parallel processing technologies, provides real-time functions and machine learning functions. Although official documentation guides for these functions are provided, a method for fusion of functions to predict a specific value in real time is not provided. Therefore, in this paper, we conducted a study to predict the value of data in real time by fusion of these functions. The overall configuration is collected by downloading stock price data provided by the Python programming language. And it creates a model of regression analysis through the machine learning function, and predicts the adjusted closing price among the stock price data in real time by fusing the real-time streaming function with the machine learning function.

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

Recently with increase of data in the Internet, platform technologies that can process huge data effectively such as Google platform and Hadoop are regarded as worthy of notice. In this kind of platform, there exist network I/O overheads to send task outputs due to the MapReduce operation which is a programming model to support parallel computation in the large cluster system. In this paper, we suggest applying of TIPC (Transparent Inter-Process Communication) protocol for reducing network I/O overheads and increasing network performance in the distributed computing environments. TIPC has a lightweight protocol stack and it spends relatively less CPU time than TCP because of its simple connection establishment and logical addressing. In this paper, we analyze main features of the Hadoop-based distributed computing system, and we build an experimental model which can be used for experiments to compare the performance of various protocols. In the experimental result, TIPC has a higher bandwidth and lower CPU overheads than other protocols.