• Title/Summary/Keyword: dynamic scheduling system

Search Result 253, Processing Time 0.026 seconds

Dynamic Scheduling Method for MPEG-based Multimedia Tasks in Hard Real-Time System (경성 실시간 시스템에서 MPEG 기반 멀티미디어 태스크를 위한 동적 스케쥴링 기법)

  • Kim, Jinhwan;Jung, Inhwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.127-130
    • /
    • 2004
  • 본 논문에서는 경성 실시간 환경에서 MPEG 비디오 스트림을 디코딩하는 멀티미디어 태스크와 경성 실시간 태스크를 효율적으로 스케쥴링하는 기법이 제시된다. 연성 실시간 특성을 갖는 멀티미디어 태스크는 평균 실행 시간을 기반으로 처리되는 반면 경성 실시간 태스크는 최악의 경우에 대한 실행 시간을 기반으로 실행이 보장된다. 서버를 기반으로 하는 본 논문의 스케쥴링 기법은 CPU 대역폭을 두 태스크들에 대하여 분할하며 멀티미디어 태스크들에 대하여는 할당된 대역폭이 다시 동적으로 조정한다. 제시된 기법의 목적은 시스템에 존재하는 경성 실시간 태스크들의 시간적 제약성을 모두 보장하면서 멀티미디어 태스크들의 종료시한이후 실행이 지연되는 시간을 최소화하는 것이다.

  • PDF

Evaluation of Ramping Capability for Day-ahead Unit Commitment considering Wind Power Variability (풍력발전의 변동성을 고려한 기동정지계획에서의 적정 Ramping 용량 산정)

  • Lyu, Jae-Kun;Heo, Jae-Haeng;Park, Jong-Keun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.4
    • /
    • pp.457-466
    • /
    • 2013
  • Wind energy is rapidly becoming significant generating technologies in electricity markets. As probabilistic nature of wind energy creates many uncertainties in the short-term scheduling, additional actions for reliable market operation should be taken. This paper presents a novel approach to evaluate ramping capability requirement for changes in imbalance energy between day-ahead market and real-time market due to uncertainty of wind generation as well as system load. Dynamic ramp rate model has been applied for realistic solution in unit commitment problem, which is implemented in day-ahead market. Probabilistic optimal power flow has been used to verify ramping capability determined by the proposed method is reasonable in economic and reliable aspects. This approach was tested on six-bus system and IEEE 118-bus system with a wind farm. The results show that the proposed approach provides ramping capability information to meet both forecasted variability and desired confidence level of anticipated uncertainty.

Load Balancing Approach to Enhance the Performance in Cloud Computing

  • Rassan, Iehab AL;Alarif, Noof
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.2
    • /
    • pp.158-170
    • /
    • 2021
  • Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

A Study on the Design Method of dynamic gateway system for MOST GATEWAY Performance Analysis in MOST25 and MOST150 Networks (MOST25와 MOST150 네트워크에서 효율적인 데이터 전송을 위한 MOST GATEWAY 성능분석을 위한 설계 방안)

  • Jang, Seong-Jin;Jang, Jong-Yug
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.712-715
    • /
    • 2010
  • In recent years, the driver needs the convenience of their vehicles and that there is an increasing requirement. Many researches have been mainly focused on MOST Networks to provide quality of multimedia service. The MOST network to support different bandwidth(MOST 25, MOST 50, MOST 150) should consist of a heterogeneous network. So the networks to used different protocols required gateway for receive and transmit information. The method to used gateway has problems occured loss of a packet by a lot of delay. In our previous research, we proposed a MOST GATEWAY system for organically connected to the network MOST150 and MOST 25. Therefore in this paper, we propose a simulation design Method of dynamic gateway system for MOST GATEWAY Performance Analysis in MOST25 and MOST150 Networks.

  • PDF

Dynamic Stream Merging Scheme for Reducing the Initial Latency Time and Enhancing the Performance of VOD Servers (VOD 서버의 초기 대기시간 최소화와 성능 향상을 위한 동적 스트림 합병 기법)

  • 김근혜;최황규
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.5
    • /
    • pp.529-546
    • /
    • 2002
  • A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

  • PDF

The Design of ONU and OLT for Dynamic Bandwidth Allocation on Ethernet PON (EPON의 동적대역폭할당을 위한 ONU와 OLT 설계)

  • 이순화;이종호;김장복
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11B
    • /
    • pp.1016-1022
    • /
    • 2003
  • The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm(AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

The Design of ONU and OLT for Dynamic Bandwidth Allocation on Ethernet PON (EPON의 동적대역폭할당을 위한 ONU와 OLT 설계)

  • 이순화;이종호;김장복
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.272-278
    • /
    • 2004
  • The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology. EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm (AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

Dynamic Allocation of Channel Times based on Link Quality of HR-WPAN (HR-WPAN에서 링크 상태에 따른 동적 채널 타임 할당 기법)

  • Kang, Jae-Eun;Byun, Sung-Won;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.264-273
    • /
    • 2009
  • For IEEE 802.15.3 HR-WPAN, we propose the DABL algorithm that PNC can allocate the channel times to the DEV in super frame in order that system frame throughput is increased and the delay is decreased. In detail, the DABL algorithm allows to dynamically allocate channel time as well as to adaptively apply the modulation and coding scheme based on the link quality of the DEV. In addition, due to the facts that QoS is quite different depending on service types, we provide the DABL algorithm taking into account RT(Real Time) traffic and Non-RT traffic respectively. Finally, we show simulation results of the DABL algorithm compared to the conventional algorithm that the PNC equally allocates channel times to the DEV regardless of the link quality of the DEV.

Modeling and Active Control of an Air-Cell Seat for Ride-Comfort Improvement (승차감 향상을 위한 에어셀시트의 모델링 및 능동제어)

  • Hong, Keum-Shik;Hwang, Su-Hwan;Hong, Kyung-Tae;Yoo, Wan-Suk
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.11
    • /
    • pp.1672-1684
    • /
    • 2004
  • In this paper, an active vibration control with the use of an air-cell seat for passenger cars is investigated. The roles of the air-cell inserted between the polyurethane foam of the seat and seat cover are first to extend the seat's capability to adopt various shapes of human body and to improve the ride-comfort against road disturbances. The air-cell seat is modeled as a 1-d.o.f. spring-damper system. Because an exact modeling of the air-cell itself is alomost impossible, its dynamic characteristics are analyzed through experiments. A road-adaptive gain-scheduled sky-hook control for the air-cell seat system is proposed. The skyhook gains are scheduled in such a way that the acceleration level transmitted to human body on various road conditions is minimized. Simulations and experimental results are provided.

A Deadline_driven CPU Power Consumption Management Scheme of the TMO-eCos Real-Time Embedded OS (실시간 임베디드 운영체제 TMO-eCos의 데드라인 기반 CPU 소비 전력 관리)

  • Park, Jeong-Hwa;Kim, Jung-Guk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.4
    • /
    • pp.304-308
    • /
    • 2009
  • This paper presents the deadline driven CPU-Power management scheme for the Real-Time Embedded OS: named TMO-eCos. It used the scheduling scenarios generated by a task serialization technique for hard real- time TMO system. The serializer does a off-line analysis at design time with period, deadline and WCET of periodic tasks. Finally, TMO-eCos kernel controls the CPU speed to save the power consumption under the condition that periodic tasks do not violate deadlines. As a result, the system shows a reasonable amount of power saving. This paper presents all of these processes and test results.