• Title/Summary/Keyword: 스케줄링 시스템

Search Result 976, Processing Time 0.027 seconds

Resource Allocation for Maximizing Energy Efficiency in Energy Harvesting Networks with Channel Estimation Error (채널 추정 오차가 존재하는 에너지 하베스팅 네트워크에서 에너지 효율성을 최대화 하는 자원할당 방안)

  • Lee, Kisong;Hong, Jun-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.506-512
    • /
    • 2016
  • Recently, energy harvesting technology is considered as a tool to improve the lifetime of sensor networks by mitigating the battery capacity limitation problem. However, the previous work on energy harvesting has failed to provide practical information since it has assumed an ideal channel knowledge model with perfect channel state information at transmitter (CSIT). This paper proposes an energy efficient resource allocation scheme that takes account of the channel estimation process and the corresponding estimation error. Based on the optimization tools, we provide information on efficient scheduling and power allocation as the functions of channel estimation accuracy, harvested energy, and data rate. The simulation results confirm that the proposed scheme outperforms the conventional energy harvesting networks without considering channel estimation error in terms of energy efficiency. Furthermore, with taking account of channel estimation error, the results provides a new way for allocating resources and scheduling devices.

Performance Evaluation of Request Scheduling Techniques in the Linux Cluster Web Server (리눅스 클러스터 웹 서버의 요청 스케줄링 기법 성능 평가)

  • Lee, Kyu-Han;Lee, Jong-woo;Lee, Jae-Won;Kim, Sung-Dong;Chae, Jin-seok
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.285-294
    • /
    • 2003
  • The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.

Mathematical Modeling of Scheduling Problems for the Fusion Fuel Cycle (핵융합 공정주기에서의 생산 계획 최적화)

  • Lee, Suh-Young;Ha, Jin-Kuk;Lee, In-Beum;Lee, Euy Soo
    • Korean Chemical Engineering Research
    • /
    • v.58 no.4
    • /
    • pp.596-603
    • /
    • 2020
  • In this study, a mathematical model for optimal operation of the fusion fuel cycle is developed based on scheduling approach. The fusion fuel cycle consists of a system for storing and supplying deuterium and tritium, and receiving and separating process after the fusion reaction. Except that tritium is a radioactive material, most of these processes consist of catalytic reactions and separation process. For these reasons, it is possible to apply scheduling approach which is also widely utilized to chemical plants to derive the optimal operating scenarios. The developed model determined the optimal regeneration cycle to minimize the amount of tritium inside the vacuum pumps. Based on the characteristics of various device in the fusion reactor, the optimal tritium plant operation scenario is evaluated. The formulated model was applied to the actual tokamak scenario and utilized to analyze the fuel flow and balance of ITER fuel cycle.

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.

Development of Flight Control System for Gliding Guided Artillery Munition - Part II : Guidance and Control (유도형 활공 탄약 비행제어시스템 개발 Part II : 유도 및 제어)

  • Lim, Seunghan;Pak, Changho;Cho, Changyeon;Bang, Hyochoong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.42 no.3
    • /
    • pp.229-236
    • /
    • 2014
  • In this paper, the guidance laws and controllers for the gliding guided artillery munition is studied. The gliding guided artillery munition has wings for gliding to increase a range; therefore previous guidance laws and controllers for the guided munition could not be applied. Concepts of vector field guidance and proportional navigation guidance are applied for mid-term and terminal guidance, respectively. The gliding guided artillery munition is operated within wide altitude and speed areas; therefore, the controllers are designed for each area, and gain-scheduling and the linear interpolation technique is applied to compute the appropriate gains.

The Implementation of Fault Tolerance Service for QoS in Grid Computing (그리드 컴퓨팅에서 서비스 품질을 위한 결함 포용 서비스의 구현)

  • Lee, Hwa- Min
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.3
    • /
    • pp.81-89
    • /
    • 2008
  • The failure occurrence of resources in the grid computing is higher than in a tradition parallel computing. Since the failure of resources affects job execution fatally, fault tolerance service is essential in computational grids. And grid services are often expected to meet some minimum levels of quality of service (QoS) for desirable operation. However Globus toolkit does not provide fault tolerance service that supports fault detection service and management service and satisfies QoS requirement. Thus this paper proposes fault tolerance service to satisfy QoS requirement in computational grids. In order to provide fault tolerance service and satisfy QoS requirements, we expand the definition of failure, such as process failure, processor failure, and network failure. And we propose resource scheduling service, fault detection service and fault management service and show implement and experiment results.

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

QoS-Aware Channel Sensing Scheduling for Cognitive Radio Network (Cognitive Radio 네트워크에서 QoS를 보장하는 채널 센싱 스케줄링 방법)

  • Kwon, Ki-Hyuk;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6A
    • /
    • pp.484-493
    • /
    • 2009
  • For the flexible frequency utilization, cognitive radio technique has been prominently considered. The most important requirement in cognitive radio networks is to protect the communications of primary users. Spectrum sensing task by secondary users should be seriously considered in cognitive radio networks, since the spectrum sensing process makes their current quality of service worse. In this paper, we propose the channel sensing scheduling method that keeps the requirements for protecting the primary and guarantee the secondary user's quality of service as possible. The quality of service of secondary user is analyzed in terms of packet delay and loss while the protection-requirements in terms of sensing interval and sensing time predefined. In numerical analysis, we can get appropriate parameters which guarantee QoS in various environment. And simulation results show that this method can improve the performance, delay and the number of transmitted packets against consecutive sensing method.

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.

A Packet Collision Avoidance Technique in IEEE1609.4 Based Time Synchronization Multi-channel Environment (IEEE1609.4 기반 시간 동기 멀티채널 환경에서의 패킷 충돌 회피 기법)

  • Jin, Seong-Keun;Lim, Ki-Taeg;Shin, Dae-Kyo;Yoon, Sang-Hun;Jung, Han-Gyun
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.385-391
    • /
    • 2015
  • In this paper, we analyze the communication performance in a time synchronous multi-channel environment and deal with a packet collision avoidance technique to improve it based on IEEE1609.4 for increasing the efficiency of the control channel IEEE802.11p WAVE communication system. In previous works, they tried to solve this problem by message scheduling method on application layer software or changing the value of the random back-off optionally Contention Window. In this paper, we propose a method for adjusting the Channel Guard Interval for packet collision avoidance. The performance was evaluated by the actual vehicle test. The result was confirmed performance over 90% PDR(Packet Delivery Ratio).