• The Journal of Society for e-Business Studies
• /
• v.7 no.3
• /
• pp.203-218
• /
• 2002

According as development of networks and increasing on Internet service, For the performance increase of K4 Firewall require that hardware be installed of 2 CPU or 4 CPU instead of 1 CPU. Output of performance test among 1CPU, 2CPU, and 4CPU of K4 Firewall system has not any efficient about increasing multiple CPUs. K4 Firewall put performance on setting on demon of packet filtering rules and Network Address Translate and Authentication and Proxy services. Performance results that setting after security rules are less 2％ Packet Filtering, 8％-11％ NAT, 18％-20％ Proxy and Authentication services than setting before security rules on K4 Firewall System. NAT and Proxy service have decrease of performance. This performance result comes in useful for research and development on K4 Firewall System.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.373-375
• /
• 2002

본 논문은 실시간 운영체제에서 프로세스의 효율적인 관리를 위한 스케줄링 알고리즘을 제안한다. 따라서 CPU의 활용도를 높이고 스케줄링 시간과 인터럽트 시간을 줄임으로서 자원을 효율적으로 관리할 수 있다. 본 논문에서 제안하는 방법으로는 다중 큐에 PIT(Process Information Table)를 두어 각각의 큐에 프로세스가 들어오면 우선순위에 따라 CPU를 할당하는 방법이다. 기존의 다중 큐와는 달리 우선순위 프로세스를 보다 정확하고 빨리 찾아내어 외부 또는 내부의 인터럽트에 응답 할 수 있게 하였다. 또한 우선순위에 밀려 실행하지 못하는 프로세스는 일정 시간이 경과하면 CPU를 선점할 수 있다. 그러므로 CPU는 활용도가 높아지고 유휴 시간은 짧아지게 된다. 본 논문은 일반 펜티엄 PC에서 실험하였으며 현재 사용되는 RTOS(VxWorks, QNX)와 비교하여 다소 우수함을 보였다.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.493-501
• /
• 2013

A key challenge in massively multiplayer on-line game(MMOG) systems is providing real-time response latencies to the large number of concurrent game players. MMOG systems are a kind of soft real-time systems because requests from many players should be responded within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In order to meet their timing constraints, we propose priority scheduling methods that attempt to allocate preferentially more CPU bandwidth to serve an task with the higher priority level in the presence of transient overloading. The proposed scheduling methods are capable of enhancing real-time performance of MMOG system by maximizing the number of tasks with higher priority completed successfully within their deadlines while minimizing total average latency of tasks finished after given deadlines. The performance of these scheduling methods is evaluated through extensive simulation experiments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.499-506
• /
• 2004

The copper foil surface inspection system is necessary for the factory automation and product quality. The developed system is composed of the high speed line scan camera, the image capture board and the processing computer. For the system resource utilization and real-time processing, multi-threaded architecture is introduced. There are one image capture thread, 2 or more defect detection threads, and one defect communication thread. To process the high-speed input image data, the I/O overlap is used through the double buffering. The defect is first detected by the predetermined threshold. To cope with the light irregularity, the compensation process is applied. After defect detection, defect type is classified with the defect width, eigenvalue ratio of the defect covariance matrix and gray level of defect. In experiment, for high-speed input image data, real-time processing is possible with multi -threaded architecture, and the 89.4% of the total 141 defects correctly classified.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.2
• /
• pp.137-140
• /
• 2004

다중 프로세서 시스템이 개발됨에 따라, 새로운 일정계획문제, 하나의 작업이 하나이상의 기계에 의해 동시에 처리되어야 하는 문제가 대두되었다. 이 연구에서는 선행관계를 가진 이러한 다중 프로세서 일정계획문제에 대해 다루어 보았다. 이 연구의 목적은 makespan을 최소화하는 일정계획을 찾는 것이다. 일반적으로 Branch and Bound 기법을 이용하여 선행관계를 가진 다중 프로세서 일정계획문제의 최적해를 찾았는데, 해의 탐색시간이 너무 오래 걸린다는 단점이 있었다. 본 연구에서는 짧은 시간 내에 최적해와 가까운 근사해를 simulated annealing(SA)방법을 이용하여 구해보았다. SA의 성능을 측정하기 위하여, SA의 CPU 처리시간과 구한 근사해를 40개의 예제문제를 통하여 Kramer의 방법의 CPU 처리시간과 최적해와 비교해 보았다.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.27-33
• /
• 2016

Virtualization has become one of the most helpful techniques in computing systems, and today it is prevalent in several computing environments including desktops, data-centers, and enterprises. However, since I/O layers are implemented to be oblivious to the I/O behaviors on virtual machines (VM), there still exists an I/O scalability issue in virtualized systems. In particular, when a multi-queue solid state drive (SSD) is used as a secondary storage, each system reveals a semantic gap that degrades the overall performance of the VM. This is due to two key problems, accelerated lock contentions and the I/O parallelism issue. In this paper, we propose a novel approach, including the design of virtual CPU (vCPU)-dedicated queues and I/O threads, which efficiently distributes the lock contentions and addresses the parallelism issue of Virtio-blk-data-plane in virtualized environments. Our approach is based on the above principle, which allocates a dedicated queue and an I/O thread for each vCPU to reduce the semantic gap. Our experimental results with various I/O traces clearly show that our design improves the I/O operations per second (IOPS) in virtualized environments by up to 155% over existing QEMU-based systems.

• Annual Conference of KIPS
• /
• 2014.04a
• /
• pp.31-32
• /
• 2014

다중의 명령어를 동시에 수행할 수 있는 멀티코어 시스템의 특성으로 하나의 시스템 내에서 태스크를 수행하면서 외부 이벤트의 발생에 의한 인터럽트를 동시에 처리할 수 있다. 각 태스크가 처리되어야 하는 시간에 제약성을 갖는 실시간 시스템에서는 스케줄러에 의해 CPU 코어에서의 수행이 제어되어야한다. 본 논문에서는 최적이라고 알려진 Pfair 멀티코어 스케줄러의 각 코어별 유휴시간을 정량적으로 평가함으로써 인터럽트 처리의 지연시간을 분석한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.4
• /
• pp.388-393
• /
• 2019

As a fiiting method to data with outliers, RANSAC(RANdom SAmple Consensus) based algorithm is widely used in fitting of line, circle, ellipse, etc. CUDA is currently most widely used GPU with massive parallel processing capability. This paper proposes an efficient CUDA implementation of multiple planes fitting using RANSAC with 3d points data, of which one set of 3d points is used for one plane fitting. The performance of the proposed algorithm is demonstrated compared with CPU implementation using both artificially generated data and real 3d heights data of a PCB. The speed-up of the algorithm over CPU seems to be higher in data with lower inlier ratio, more planes to fit, and more points per plane fitting. This method can be easily applied to a wide variety of other fitting applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.57-64
• /
• 2012

Multiplayer, real-time games are a kind of soft real-time systems because a game server has to respond to requests from many clients within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to different priorities on CPU processing. Events can be divided into different groups, depending on their consistency degree and priority. To handle these events with different priority and meet their timing constraints, we propose a priority-based group task scheduling policy in this paper. The number of clients or events requested by each client may be increased temporarily. In the presence of transient overloading, the game server needs to allocate more CPU bandwidth to serve an event with the higher priority level preferentially. The proposed scheduling policy is capable of enhancing real-time performance of the entire system by maximizing the number of events with higher priority completed successfully within their deadlines. The performance of this policy is evaluated through extensive simulation experiments.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.111-122
• /
• 2003

Military wargame simulation models must support the HLA in order to facilitate interoperability with other simulations, and using parallel simulation engines offer efficiency in reducing system overhead generated by propelling interoperability. However, legacy military simulation model engines process events using sequential event-driven method. This is due to problems generated by parallel processing such as synchronous reference to global data domains. Additionally. using legacy simulation platforms result in insufficient utilization of multiple CPUs even if a multiple CPU system is under use. Therefore, in this paper, we propose conversing the simulation engine to an object model-based parallel simulation engine to ensure military wargame model's improved system processing capability, synchronous reference to global data domains, external simulation time processing, and the sequence of parallel-processed events during a crash recovery. The converted parallel simulation engine is designed and implemented to enable parallel execution on a multiple CPU system (SMP).