• Journal of the Semiconductor & Display Technology
• /
• v.20 no.3
• /
• pp.117-119
• /
• 2021

With the development of the industry, the use of drones in specific mission flight is being actively studied. These drones fly a specified path and perform repetitive tasks. if the drone system will detect objects in real time, the performance of these mission flight will increase. In this paper, we implement object detection system and mount GPU acceleration to maximize the efficiency of limited device resources with drone video using Tensorflow Lite which enables in-device inference from a mobile device and Mobile SDK of DJI, a drone manufacture. For performance comparison, the average processing time per frame was measured when object detection was performed using only the CPU and when object detection was performed using the CPU and GPU at the same time.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.367-379
• /
• 1994

This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.345-354
• /
• 2004

In these days, such services are popularized as E-commerce, E-government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of server resources when heavy requests reach the web server Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.781-786
• /
• 2004

In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.141-149
• /
• 2022

With the development of artificial intelligence and unmanned technologies, the remote surveillance/autonomous driving systems have been actively researched. For an effective performance analysis of the developed remote control system, it is important to record the data of it in real time. In addition, in order to analyze the performance between the control system and the remote system, the recorded data from them should be synchronized with time. In this paper we proposed a novel time synchronization method for the remote control system. The proposed remote control system satisfies the time difference of the recorded data within 1 ms, and we can reduce the time difference by using a CPU shielding and affinity setting. The performance of the proposed method was proved through various network data storage experiments. And the experiments confirmed that the proposed method can be applied to recording devices of unmanned ground vehicles and control vehicles. The proposed method will be used as a method for analyzing network data of UGV-R (Unmanned Ground Vehicle - Reconnaissance).

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.623-631
• /
• 2014

Comparison of two representative deduplication file systems, LessFS and SDFS, shows that Lessfs is better in execution time and CPU utilization while SDFS is better in storage usage (around 1/8 less than general file systems). In this paper, a new system is proposed where the advantages of SDFS and Lessfs are combined. The new system uses multiple DFEs and one DSE to maintain the integrity and consistency of the data. An evaluation study to compare between Single DFE and Dual DFE indicates that the Dual DFE was better than the Single DFE. The Dual DFE reduced the CPU usage and provided fast deduplication time. This reveals that proposed system can be used to solve the problem of an increase in large data storage and power consumption.

• Geophysics and Geophysical Exploration
• /
• v.20 no.3
• /
• pp.129-136
• /
• 2017

3D seismic data processing methods such as full waveform inversion or reverse-time migration require 3D wave propagation modeling and heavy calculations. We compared efficiency and accuracy of a Xeon Phi coprocessor to those of a high-end server CPU using 3D frequency-domain wave propagation modeling. We adopted the OpenMP parallel programming to the time-domain finite difference algorithm by considering the characteristics of the Xeon Phi coprocessors. We applied the Fourier transform using a running-integration to obtain the frequency-domain wavefield. A numerical test on frequency-domain wavefield modeling was performed using the 3D SEG/EAGE salt velocity model. Consequently, we could obtain an accurate frequency-domain wavefield and attain a 1.44x speedup using the Xeon Phi coprocessor compared to the CPU.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.127-135
• /
• 2015

Context-aware mobile cloud computing is a new promising paradigm that allows to improve user experience by analyzing contextual information such as user location, time of the day, neighboring devices and current activity. In this paper we provide performance study of context-aware mobile cloud computing system with Volare middleware. Volare monitors the resources and context of the device. and dynamically adapts cloud service requests accordingly, at discovery time or at runtime. This approach allows for more resource-efficient and reliable cloud service discovery, as well as significant cost savings at runtime. We also have studied the performance of context-aware mobile cloud computing for different quality of service (QoS) adaptation policies. Our simulations results show that when battery level is low and CPU usage is high and user cannot maintain the initial QoS, service cost is decreased according to current adaptation policy. In conclusion, the current adaptation policy suggested in this paper may improve user experience by providing a dynamically adapted service cost according to a situation.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1794-1801
• /
• 2008

Fire-driven flow and temperature distribution in a ventilated tunnel was analyzed by Large Eddy Simulation using FDS code. The simulated tunnel is 182m length, 5.4m wide and 2.4m height. A pool fire was located 112m from tunnel entrance and was taken as a heat source of $0.89m^2$. The heat is assumed to be released uniformly throughout the whole simulated time. The fire strength was 2.76MW and the fuel burnt was octane. The parallel computational method was employed to accelerate the computing time and manage the large grid points which is not possible to handle in the one CPU. The total grid points used were $2.4{\times}10^6$ and 7 CPUs were used to calculate the momentum and energy equations. The simulated results were well compared with the experiments.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.173-180
• /
• 2005

In this paper, we propose an efficient real-time scheduling method of multimedia tasks for decoding frames of MPEG-2 video streams. In our task model, each frame is decoded by a separate multimedia task. The decoding task for each frame is assigned to the priority according to the precedence and importance of frames in a video stream. We use a priority-based scheduling policy in order to effectively allocate the CPU bandwidth to multimedia tasks for MPEG-2 decoding. We show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task according to the priority. The primary purpose of our scheduling method is to enhance the real-time performance of the multimedia system by minimizing the number of decoding tasks that have missed their deadlines while reducing the decoding times of these multimedia tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.