• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.6
• /
• pp.305-312
• /
• 2018

Software has been used to develop many functions of the modern weapon systems which has a high mission criticality. Weapon system software must consider multi-threaded processing to satisfy growing performance requirement. However, developing multi-threaded programs are difficult because of concurrency faults, such as unintended data races. Especially, it is important to prepare analysis for debugging the data races, because the weapon system software may cause personal injury. In this paper, we present an efficient framework of analysis, called ConDeWS, which is designed to determine the scope of dynamic analysis through using the result of static analysis and fault analysis. As a result of applying the implemented framework to the target software, we have detected unintended data races that were not detected in the static analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2479-2496
• /
• 2013

Increasing demand for Full High-Definition (FHD) video and Ultra High-Definition (UHD) video services has led to active research on high speed video processing. Widespread deployment of multi-core systems has accelerated studies on high resolution video processing based on parallelization of multimedia software. Even if parallelization of a specific decoding step may improve decoding performance partially, such partial parallelization may not result in sufficient performance improvement. Particularly, entropy decoding has often been considered separately from other decoding steps since the entropy decoding step could not be parallelized easily. In this paper, we propose a parallelization technique called Integrated Multi-Threaded Parallelization (IMTP) which takes parallelization of the entropy decoding step, with other decoding steps, into consideration in an integrated fashion. We used the Simultaneous Multi-Threading (SMT) technique with appropriate thread scheduling techniques to achieve the best performance for the entire decoding step. The speedup of the proposed IMTP method is up to 3.35 times faster with respect to the entire decoding time over a conventional decoding technique for H.264/AVC videos.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.722-730
• /
• 2014

Due to the advance of hardware, various devices have mobility features, and many applications need the data transmission. In addition, it is essential for latest smartphones to utilize multi-cores and multi-threads because of the enhancement of Application Processor. Therefore, this paper analyzes the performance/power consumption according to transmission rate, the number of cores, and that of threads in the system that is supposed to conduct data transmission and processing simultaneously. Through the analysis, this paper provides a direction for the proper number of threads in terms of performance improvement and efficient power consumption.

• The Journal of Society for e-Business Studies
• /
• v.6 no.2
• /
• pp.13-24
• /
• 2001

The Real-Time Best-Estimate simulator NPA4K is being developed for providing an efficient nuclear power, KALIMER, simulation environment for transient safety analyses using information visualization. The advanced features of NPA4K simulator are the Once-Through Running Environment, Functionalities of displaying the several X-Y Plot on one system, and Multi-thread Processing, The objective of NPA4K simulator is ta realize the Virtual Reality Environment through Network and Internet technology in Nuclear Power Plants.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.328-330
• /
• 2003

본 논문에서는 멀티미디어 프리젠테이션 과정에서 발생할 수 있는 여러 동기화 요소를 고려한 프리젠테이션 제어 방안에 대하여 기술하였다. 효율적인 프리젠테이션을 위하여 모노 미디어의 개별적인 효과 표현과 시나리오를 기반으로 한 스케줄러, 그리고 여러 하드웨어 및 소프트웨어 관리 쓰레드 등으로부터 동기화와 직.간접적으로 관련된 이벤트를 발생시키고 이러한 이벤트를 종합적으로 관리하도록 하였다. 발생된 이벤트는 불규칙하고 동시다발적이기 때문에 발생 환경에 따라 적절하게 폐기하거나 처리의 선후관계를 다시 정의하는 등 프리젠테이션 환경에 따른 최적의 서비스 품질을 유지할 수 있도록 고려하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.471-472
• /
• 2023

본 논문에서는 멀티 쓰레드를 이용하여 UI에 영상을 표현할 때, 걸리는 시간 및 적정 사용 방법을 연구하였다. 영상처리는 오픈 API인 OpenCV를 사용하여 처리하였으며, 1~4개의 스레드로 영상을 다운로드하는 시간부터 GUI에 보여주는 시간까지를 계산하는 기능을 구현하여 영상을 다운로드하고, GUI에 넣어주어야 할 때 스레드의 개수가 퍼포먼스에 관여하는 처리속도를 알아볼 수 있다.

• Journal of the Korean Society of Industry Convergence
• /
• v.9 no.4
• /
• pp.277-283
• /
• 2006

As the products such as HDD, Notebook, PDA, and Mobile Phone become smaller and thinner, the radius of threads as well as holes for assembling those products become smaller, even down to 1mm. To produce such small holes and thread efficiently, multi tapping is highly necessitated. However the multi tapping characteristics is not well known because its complicated cutting mechanism and thus the quality of the produced holes and threads is not well studied yet. In this paper, experiments have been conducted for small-radius threads using M2 and M2.6 and M3 cold forming tap to investigate multi tapping process using several useful signal such as torque and Z-axis encoder pulse. The surface and profile of the machined threads have been magnified and observed through a SEM.

• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.381-390
• /
• 2015

One of the fundamental requirements of entertainment applications is interactivity with users. The mobile device such as the smartphone, however, does not guarantee it due to the limit of the application processor's computing power, memory size and available electric power of the battery. This paper proposes a methodology to boost responsiveness of interactive applications by taking advantage of the parallel architecture of mobile devices which, for instance, have dual-core, quad-core or octa-core. To harness the multi-core architecture, it exploits the POSIX thread, a platform-independent thread library to be able to be used in various mobile platforms such as Android, iOS, etc. As a useful application example of the methodology, a heavy matrix calculation function was transformed to a parallelized version which showed around 2.5 ~ 3 times faster than the original version in a real-world usage environment.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.1997-2012
• /
• 1998

It is necessary to find out the parallelism in tlle sequential Java program to execute it on the parallel machine. The loop is a fundamental source to exploit parallelism as it process a large portion of total execution time in sequential Java program on the parallel machine. However, a complete parallel execution can hardly be achieved due to data dependence. This paper proposes the method of exploiting the implicit parallelism by structuring a dependence graph through the analysis of data dependence in the existing Java programming language having a nested loop structure. The parallel code generation method through the restructuring compiler and also the translation method of Java source program into multithread statement. which is supported by the Java programming language itself, are proposed here. The perforance evaluatlun of the program translaed into the thread statement is conducted using the trip cunt of loop and the trip Count of luop and the thread count as parameters The resttucturing compiler provides efficient way of exploiting parallelism by reducing manual overhead conveliing sequential Java program into parallel code. The execution time for the Java program as a result can be reduced un the parallel machine.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.9-15
• /
• 2019

Since the computational complexity for hologram generation increases exponentially with respect to the size of the point cloud, parallel processing using CUDA and/or OpenCL library based on multiple GPUs has recently become popular. The CUDA kernel for parallelization needs to consist of threads, blocks, and grids properly in accordance with the number of cores and the memory size in the GPU. In addition, in case of multiple GPU environments, the distribution in grid-by-grid, in block-by-block, or in thread-by-thread is needed according to the number of GPUs. In order to evaluate the performance of CGH generation, we compared the computational speed in CPU, in single GPU, and in multi-GPU environments by gradually increasing the number of points in a point cloud from 10 to 1,000,000. We also present a memory structure design and a calculation method required in the CUDA-based parallel processing to accelerate the CGH (Computer Generated Hologram) generation operation in multiple GPU environments.