• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.9
• /
• pp.189-196
• /
• 2020

Recently, GPU cloud computing technology applying GPU(Graphics Processing Unit) devices to virtual machines is widely used in the cloud environment. In a cloud environment, GPU devices assigned to virtual machines can perform operations faster than CPUs through massively parallel processing, which can provide many benefits when operating high-performance computing services in a variety of fields in a cloud environment. In a cloud environment, a GPU device can help improve the performance of a virtual machine, but the virtual machine scheduler, which is based on the CPU usage time of a virtual machine, does not take into account GPU device usage time, affecting the performance of other virtual machines. In this paper, we test and analyze the performance degradation of other virtual machines due to the virtual machine that performs GPGPU(General-Purpose computing on Graphics Processing Units) task in the direct path based GPU virtualization environment, which is often used when assigning GPUs to virtual machines in cloud environments. Then to solve this problem, we propose a GPGPU task management method for a virtual machine.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1508-1516
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that supports multipath transmission. If a bufferbloat occurs in one of the subflows of MPTCP, HoL blocking occurs at the receiver due to the difference in packet arrival time among paths. In MPTCP, HoL blocking degrades not only the performance of the path where bufferbloat occurs, but also the performance of other paths. In this paper, we propose a bandwidth measurement based scheduler to solve this problem. Bandwidth measurement based scheduler is designed to measure the bandwidth of each subflow and to perform packet scheduling based on it. In order to verify the proposed scheduler, we implemented the proposed scheduler in the Linux kernel and constructed a testbed in which bufferbloat occurs. Experimental results show that the proposed scheduler has better performance than the legacy MPTCP in bufferbloat environment.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.437-446
• /
• 2002

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (Random Early Detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional Drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Active RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm can effectively reduce packet loss while maintaining high link utilizations.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.9-18
• /
• 2002

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guarangteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, thus scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

• Journal of the Korea Society for Simulation
• /
• v.27 no.1
• /
• pp.75-90
• /
• 2018

Generally, solutions that can increase patients' satisfaction are in conflict with the solutions that can increase the satisfaction and profitability of the medical personnels. In this paper, we compare appointment patterns using multiple performance measures that take into account both hospital's position and customers' position, and propose the best appointment pattern especially for an efficient scheduling in a plastic surgery clinic. A simulation model using ARENA is designed based on real hospital data. Based on this model, we compare 5 appointment patterns. To check the robustness of the appointment patterns, we have experimented on various appointment situations by considering peak, extreme peak seasons, and peak, off-peak days. We found that Triangle-like pattern turned out to be most efficient regardless of appointment situations.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.95-103
• /
• 2022

As 5G mobile communication services gradually expand in P2P (peer-to-peer) or D2D (device-to-device) applications, traffic-oriented stream control such as YouTube streaming is emerging as an important technology. In D2D communication, the type of data stream most frequently transmitted by users is a video stream, which has the characteristics of a large-capacity transport stream. In a D2D communication environment, this type of stream not only provides a cause of traffic congestion, but also degrades the quality of service between D2D User Equipments (DUEs). In this paper, we propose a Traffic-Oriented Stream Scheduling (TOSS) scheme to minimize the interruption of dynamic media streams such as video streams and to optimize streaming service quality. The proposed scheme schedules the media stream by analyzing the characteristics of the media stream and the traffic type in the bandwidth of 3.5 GHz and 28 GHz under the 5G gNB environment. We examine the performance of the proposed scheme through simulation, and the simulation results show that the proposed scheme has better performance than other comparative methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5622-5632
• /
• 2011

This paper presents the simulation design and analysis of Integrated Logistics System(ILS) which is operated by using the AGV(Automated Guided Vehicle). To maximize the operation performances of ILS with AGV, many parameters should be considered such as the number, velocity, and dispatching rule of AGV, part types, scheduling, and buffer sizes. We established the design of experiment in a way of Orthogonal Array in order to consider (1)maximizing the throughput; (2)maximizing the vehicle utilization; (3)minimizing the congestion; and (4)maximizing the Automated Storage and Retrieval System(AS/RS) utilization among various critical factors. Furthermore, we performed the optimization by using the simulation-based analysis and Evolution Strategy(ES). As a result, Orthogonal Array which is conducted far fewer than ES significantly saved not only the time but the same outcome when compared after validation test on the result from the two methods. Therefore, this approach ensures the confidence and provides better process for quick analysis by specifying exact experiment outcome even though it provides small number of experiment.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.125-140
• /
• 2018

Due to rapid development of semiconductor technology, embedded systems have been developed from single-functional system to the multi-functional system. The system composed of software that has different criticality level is called Mixed-Criticality System. Currently, the project related to the Mixed-Criticality System is accelerating the efforts to seek the development direction and take technical initiatives led by EU and USA where the related industry has developed, but the movement in Korea is yet insignificant. Therefore, it is urgent to perform the research and project of various basic technologies to occupy the initiative for the related technology and market. In this paper, we analyze the trends of major project researches and developments related to the MCS. First, after defining the definition of the MCS and system model, we analyze the underlying technology constituting the MCS. In addition, we analyze the project trends of each country researching MCS and discuss the future research areas. Through this study, it is possible to grasp the research trends of the world in order to establish the research direction of the MCS and to lay the foundation for the integration into the military system.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.7-16
• /
• 2007

In this paper, we introduce a new design environment for efficient multiprocessor system-on-chip design space exploration. The design environment takes a process network model as input system specification. The process network model has been widely used for modeling signal processing applications because of its excellent modeling power. However, it has limitation in predictability, which could cause severe problem for real time systems. This paper proposes a new approach that enables static analysis of a process network model by converting it to a hierarchical synchronous dataflow model. For efficient design space exploration in the early design step, mapping application to target architectures has been a crucial part for finding better solution. In this paper, we propose an efficient mapping algorithm. Our mapping algorithm supports both single bus architecture and multiple bus architecture. In the experiments, we show that the automatic conversion approach of the process network model for static analysis is performed successfully for several signal processing applications, and show the effectiveness of our mapping algorithm by comparing it with previous approaches.