• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.11-21
• /
• 2011

The PMIPv6 protocol that has been recently presented as an alternative for the MIPV6 has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose an effective scheduling for multicast services based on the PMIPv6 with hand-over mechanism. it provides an additional function that is able to change multicast join processes dynamically in accordance with MAG status. in order to evaluate the ability of the proposed scheme's We test the performance of hand-over and node join costs with similar techniques. The result of simulation shows improves about 13~35% of performance.

• Journal of Korea Multimedia Society
• /
• v.4 no.1
• /
• pp.13-28
• /
• 2001

In a VOD(Vide-On-Demand) system, video data are generally stored in magnetic disk array. In order to provide real-time requirement for data retrieval, video streams must be delivered continuously to the clients such that the delivery of continuous media can be guaranteed in a timely fashion. Compared to the increased performance of processors and networks, the performance of magnetic disk systems have improved only modestly. In order to improve the performance of storage system, disk array system is proposed and used. The array system improves I/O performance by placing disks in parallel and retrieving data concurrently. In this paper, two approaches are considered in order to access the video data in a VOD system, which are CTL(Constant Time Length) and CDL(Constant Data Length) access policies. Disk scheduling policies are also classified into the two categories and compared in terms of the maximum allowable video streams with different degrees of disk array synchronization, under the mixed environments in which both data access policy and disk scheduling policy are considered. Among the compared scheduling policies, LOOK was shown to have the best performance. In terms of degree of disk synchronization, more gain was achieved with large degree of synchronization. In comparisons of performance of CTL and CDL, CTL was proved to have a little superior performance in terms of number of maximum allowable streams.

• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.3
• /
• pp.391-395
• /
• 2016

In the last few decades, global electricity consumption has dramatically increased and has become drastically fluctuating and uncertain causing blackout. Due to the unexpected peak electricity demand, we need significant electricity supply. The solutions to these problems are smart grid system which is envisioned as future power system. Smart grid system can reduce electricity peak demand and induce effective electricity consumption through various price policies, demand response (DR) control methodologies, and state-of-the-art smart equipments in order to optimize electricity resource usage in an intelligent fashion. Demand response (DR) is one of the key technologies to enable smart grid. In this paper, we propose greedy technique for demand response smart grid system. The proposed scheme focuses on minimizing electricity bills, preventing system blackout and sacrificing user convenience.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.117-120
• /
• 2003

웹의 다양한 자원을 이용하여 고성능 작업 처리를 요구하는 분산/병렬 시스템은 균형적인 작업 할당을 위해 각 호스트의 성능 평가가 중요하다. 하지만 성능 평가에 대한 지속적인 신뢰하기가 어려우며 뿐만 아니라, 작업 도중 호스트의 성능 변화를 예측하기가 어렵다. 성능 변화에 따른 효율적인 작업 스케줄링이 필요하며, 자원 관리자는 작업을 수행중인 호스트에 대한 모니터가 요구된다. 본 논문에서는 자원 관리자와 시스템 관리자에게 효율적인 자원 정책을 제안하기 위해 각 호스트의 자원을 모니터하고, 분산/병렬 시스템의 작업 할당 메커니즘에 의해 각 호스트의 성능 평가 기준을 정한다 또한 관리자에게 실시간으로 호스트의 성능 변화에 따른 자원 정보를 관리하도록 다양한 시각화를 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.395-397
• /
• 2011

RT-eCos3.0은 대표적 분산 실시간 객체 모델인 TMO(Time-triggered Message-triggered Object)의 실행을 제공하기 위하여 공개소스 eCos3.0 기반으로 개발된 초경량 경성 실시간 임베디드 운영체제이다. RT-eCos3.0에서는 그간 스레드의 최장 수행 시간 입력이 필요 없는 EDF 및 FIFO 스케줄러를 지원하여 왔다. 본 논문에서는 TMO의 시간 구동 스레드와 메시지 구동 스레드의 스레드 등록 시 최장 수행 시간을 입력 받아 이를 기반으로 마감시간까지의 수행시간 대비 잔여시간을 이용하는 LLF (Least Laxity First) 스케줄러를 클럭 인터럽트 핸들러 내에 구현하고 각 스레드로 하여금 스케줄링 정책을 선택할 수 있도록 구현하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.26-29
• /
• 2017

최근 중앙 집중화된 대규모 클라우드 시스템의 증가로 인해 가상화 환경에서 수행되는 성능 최적화 작업에 대한 많은 연구가 진행되고 있다. 그러나 기존 연구에서는 자원 분배의 공정성을 위해 가상머신 단위로 컴퓨팅 자원을 격리한 정책 내에서 이루어지고 있어 유연한 자원관리에 한계를 가지고 있다. 본 연구에서는 워크로드의 특징을 기반으로 과학적 연산을 수행하는 가상머신과 일반적인 서비스를 수행하는 가상머신을 분류하여 성능 최적화 작업을 수행하는 동적 자원 관리자를 제안한다. 실험을 통하여 제안하는 동적 자원 관리자가 KVM 기본 스케줄링에 비해 49%의 성능 향상을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.316-318
• /
• 2004

유선, 무선을 합하여 초고속 네트워크의 사용이 급격하게 증가됨에 따라 고속의 네트워크 통신 서비스에 대한 요구가 증가 하였으며 차별화된 인터넷 서비스에 대한 요구가 증가함에 따라 IP 기반의 스위치가 등장하게 되었다. 이러한 스위치의 이슈는 IT 포워딩, 고속 스위치 패브릭 등의 문제를 포함하게 된다. 현재까지의 모든 패킷 스위치는 그 내부적으로 HOL블로킹에 의한 성능 저하의 영향을 최소화하기 위하여 여러 가지 스케줄링 알고리즘을 사용한다. 본 논문에서는 Gigabit 으로 동작하는 패킷 스위치 중에서 Strict Priority 알고리즘, Round Robin 알고리즘을 분석하고 각각의 스케줄러가 COS 기반과 어떤 관계가 있으며 더불어 COS 기반에 따라, 스케줄러를 동적으로 변경하여 기존의 Static 하게 정책적으로 사용되던Algorithm 과의 차별성을 두어 동적 스케줄러의 선택에 의한 Packet 처리 성능향상을 보이도록 한다.

• Korea Journal of Hospital Management
• /
• v.16 no.4
• /
• pp.161-182
• /
• 2011

In today's competitive dental markets, it is of paramount importance to improve service quality and at the same time to use scarce resource efficiently. In this study, we present appointment policies and scheduling rules for private dental clinics to reduce the waiting time of patients and to increase the revenue by utilizing resource more effectively. This study validates the proposed appointment policies and scheduling rules based on simulation models. We show that the bottleneck-based appointment policy is the most effective among appointment policies, followed by the multiple-block appointment one. The shortest processing time among scheduling rules contributes most to the performance of the appointment system.