• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.479-482
• /
• 2014

Nowadays open-source hadoop systems have been using widely to efficiently manage a fast-growing big data. Hadoop systems consist of distributed file processing system called HDFS (Hadoop Distributed File System) and distributed parallel processing system called MapReduce. The MapReduce reads and processes big data from HDFS and then processed results are written in HDFS again by the MapReduce. Such a processing method has different system structure respectively according to hadoop version. Therefore, this paper shows analysis results for performance of hadoop systems. For this, we devise a way which monitors hadoop systems and measure occurrence frequency of processes, threads, and variables generated in hadoop system itself using the devised way. So, by using the measured results as analysis indicator, we help the indicator predict inner performance of hadoop systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.736-738
• /
• 2014

As part of real-time streaming service, which is one of the latest QoS technology has become the issue. But the current majority of streaming services are specific S/W I a separate setup program supports real-time streaming service a reality, will be stored until the end of the video, save for a video about editing and is not available. In this paper, a video about multi-threaded and distributed processing system applied to the Storm technique based on separate software or installation of programs without the H T M L 5-based Web content is produced by each device using a Web browser, real-time streaming system you want, no. This is a streaming service that provides users with real-time editing and the footage is stored as about and respond in real time between the server and the client and content sharing that need training and will be utilized in the field of multimedia streaming.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.5
• /
• pp.111-118
• /
• 2019

Recent graphic processing units (GPUs) provide high throughput by using powerful hardware resources. However, massive memory accesses cause GPU performance degradation due to cache inefficiency. Therefore, the performance of GPU can be improved by reducing thread parallelism when cache suffers memory contention. In this paper, we propose a dynamic warp scheduler which controls thread parallelism according to degree of cache contention. Usually, the greedy then oldest (GTO) policy for issuing warp shows lower parallelism than loose round robin (LRR) policy. Therefore, the proposed warp scheduler employs the LRR warp scheduling policy when Miss Status Holding Register(MSHR) utilization is low. On the other hand, the GTO policy is employed in order to reduce thread parallelism when MSHRs utilization is high. Our proposed technique shows better performance compared with LRR and GTO policy since it selects efficient scheduling policy dynamically. According to our experimental results, our proposed technique provides IPC improvement by 12.8% and 3.5% over LRR and GTO on average, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.27-34
• /
• 2021

In this paper, we propose a copyright protection scheme for real-time streaming of HEVC(High Efficiency Video Coding) based realistic content. Previous research uses encryption and modular operation for copyright pre-protection and copyright post-protection, which causes delays in ultra high resolution video. The proposed scheme maximizes parallelism by using thread pool based DRM(Digital Rights Management) packaging with only HEVC's CABAC(Context Adaptive Binary Arithmetic Coding) codec and GPU based high-speed bit operation(XOR), thus enabling real-time copyright protection. As a result of comparing this scheme with previous research at three resolutions, PSNR showed an average of 8 times higher performance, and the process speed showed an average of 18 times difference. In addition, as a result of comparing the robustness of the forensic mark, the filter and noise attack, which showed the largest and smallest difference, with a 27-fold difference in recompression attacks, showed an 8-fold difference.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.3
• /
• pp.63-69
• /
• 2022

In this paper, we propose a new GPU-based framework for quickly calculating adaptive and continuous SDF(Signed distance fields), and examine cases related to rendering/collision processing using them. The quadtree constructed from the triangle mesh is transferred to the GPU memory, and the Euclidean distance to the triangle is processed in parallel for each thread by using it to find the shortest continuous distance without discontinuity in the adaptive grid space. In this process, it is shown through experiments that the cut-off view of the adaptive distance field, the distance value inquiry at a specific location, real-time raytracing, and collision handling can be performed quickly and efficiently. Using the proposed method, the adaptive sign distance field can be calculated quickly in about 1 second even on a high polygon mesh, so it is a method that can be fully utilized not only for rigid bodies but also for deformable bodies. It shows the stability of the algorithm through various experimental results whether it can accurately sample and represent distance values in various models.

• KNOM Review
• /
• v.22 no.1
• /
• pp.1-10
• /
• 2019

The process to determine the required number of resources depends on the factors being considered. Autoscaling is one such mechanism that uses a wide range of factors to decide and is a critical process in NFV. As the networks are being shifted onto the cloud after the invention of SDN, we require better resource managers in the future. To solve this problem, we propose a solution that allows the VNFMs to autoscale the system resources depending on the factors such as overhead of hyperthreading, number of requests, execution-times for the virtual network functions. It is a known fact that the hyperthreaded virtual-cores are not fully capable of performing like the physical cores. Also, as there are different types of core having different frequencies so the process to calculate the number of cores needs to be measured accurately and precisely. The platform independency is achieved by proposing another solution in the form of a monitoring microservice, which communicates through APIs. Hence, by the use of our autoscaling application and a monitoring microservice, we enhance the resource provisioning process to meet the criteria of future networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.4
• /
• pp.127-134
• /
• 2023

This paper describes how to port the eCos operating system and PROFINET communication stack developed based on gcc to the IAR compiler. The eCos operating system provides basic functions such as multi-thread, TCP/IP, and device driver for PROFINET operation, so there is no need to change it when developing PROFINET applications. Therefore, in this study, we reuse an eCos library built with gcc and it link with PROFINET communication stack that are ported to IAR complier. Due to the different of the gcc and IAR linker, symbol definitions and address of the constructors should be changed using the external tool that generates symbol definitions and address of the constructors from MAP file. In order to verify the proposed method, it was confirmed that the actual I/O was operating normally through PROFINET IRT communication by connecting to the Siemens PLC. IAR compiler has better performance in both the compile time and the size of the generated binary. The proposed method in this study is expected to help port various open sources as well as eCos and PROFINET communication stacks to other compilers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1660-1665
• /
• 2022

Recently, many industries are using three dimensional scanning technology. As the performance of the 3D scanner gradually improves, a sampling step to reduce a point data or a remove step to remove a part determined to be noise are generally performed in post processing. However, total point data by long time scanning cannot be processed at once in spite of performing such those additional processes. In general, a method using a multi threaded environment is widely used, but as the scanning process work time increases, the processing performance gradually decreases due to various environmental conditions and accumulated operations. This paper proposes a method to initially remove point data judged to be unnecessary by calculating accumulated fast point feature histogram values from coming point data of the 3D scanner in real time. The entire 3D scanning process can be reduced using this approach.

• The Journal of Bigdata
• /
• v.7 no.2
• /
• pp.91-102
• /
• 2022

As artificial intelligence develops, AI chatbot systems are actively taking place. For example, in public institutions, the use of chatbots is expanding to work assistance and professional knowledge services in civil complaints and administration, and private companies are using chatbots for interactive customer response services. In this study, we propose a scenario-based AI voice chatbot system to reduce museum operating costs and provide interactive guidance services to visitors. The implemented voice chatbot system consists of a watcher object that detects the user's voice by monitoring a specific directory in real-time, and an event handler object that outputs AI's response voice by performing inference by model sequentially when a voice file is created. And Including a function to prevent duplication using thread and a deque, GPU operations are not duplicated during inference in a single GPU environment.

• Journal of Advanced Navigation Technology
• /
• v.27 no.5
• /
• pp.495-501
• /
• 2023

P-3C/K aircraft for maritime patrols that Republic of Korea Navy is using, is equipped with a variety of sensors and communication devices. Collected data from the aircraft is managed as tactical information by flight operators and stored. When the flight mission is completed, this information is transferred to tactical support center on the ground and played back or used for follow-up work through a analysis tool. During a flight mission, there are tens of thousands of detection objects within an hour in KADIZ (Korea air defense identification zone). In contrast, in TSD (tactical situation display), which displays a map when using the analysis tool, all detected objects are expressed as symbols. The increase in display symbols has a significant impact on the TSD image updating and consequently interferes with the smooth operation of operators. In this paper, we propose applying multiple threads and multiple layers to improve the performance of existing TSD. And the performance improvement is proven through the execution results.