• Title/Summary/Keyword: Dynamic Scheduling Algorithm

Search Result 218, Processing Time 0.021 seconds

Power-Minimizing DVFS Algorithm for a Video Decoder with Buffer Constraints (영상 디코더의 제한된 버퍼를 고려한 전력 최소화 DVFS 방식)

  • Jeong, Seung-Ho;Ahn, Hee-June
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9B
    • /
    • pp.1082-1091
    • /
    • 2011
  • Power-reduction techniques based on DVFS(Dynamic Voltage and Frequency Scaling) are crucial for lengthening operating times of battery powered mobile systems. This paper proposes an optimal DVFS scheduling algorithm for decoders with memory size limitation on display buffer, which is realistic constraints not properly touched in the previous works. Furthermore, we mathematically prove that the proposed algorithm is optimal in the limited display buffer and limited clock frequency model, and also can be used for feasibility check. Simulation results show the proposed algorithm outperformed the previous heuristic algorithms by 7% in average, and the performance of all algorithms using display buffers saturates at about 10 frame size.

A Study on dynamic gateway system for MOST GATEWAY Scheduling Algorithm 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
    • /
    • 2009.10a
    • /
    • pp.784-788
    • /
    • 2009
  • 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. Therefore in this paper, we propose a MOST GATEWAY system for organically connected to the network MOST150 and MOST 25. After analyzing the performance of the existing scheduling algorithm, we will present an improvement scheme of the efficiency and scalability.

  • PDF

Optimization of Energy Consumption in the Mobile Cloud Systems

  • Su, Pan;Shengping, Wang;Weiwei, Zhou;Shengmei, Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4044-4062
    • /
    • 2016
  • We investigate the optimization of energy consumption in Mobile Cloud environment in this paper. In order to optimize the energy consumed by the CPUs in mobile devices, we put forward using the asymptotic time complexity (ATC) method to distinguish the computational complexities of the applications when they are executed in mobile devices. We propose a multi-scale scheme to quantize the channel gain and provide an improved dynamic transmission scheduling algorithm when offloading the applications to the cloud center, which has been proved to be helpful for reducing the mobile devices energy consumption. We give the energy estimation methods in both mobile execution model and cloud execution model. The numerical results suggest that energy consumed by the mobile devices can be remarkably saved with our proposed multi-scale scheme. Moreover, the results can be used as a guideline for the mobile devices to choose whether executing the application locally or offloading it to the cloud center.

Dynamic Bandwidth Allocation Algorithm with Two-Phase Cycle for Ethernet PON (EPON에서의 Two-Phase Cycle 동적 대역 할당 알고리즘)

  • Yoon, Won-Jin;Lee, Hye-Kyung;Chung, Min-Young;Lee, Tae-Jin;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.14C no.4
    • /
    • pp.349-358
    • /
    • 2007
  • Ethernet Passive Optical Network(EPON), which is one of PON technologies for realizing FTTx(Fiber-To-The-Curb/Home/Office), can cost-effectively construct optical access networks. In addition, EPON can provide high transmission rate up to 10Gbps and it is compatible with existing customer devices equipped with Ethernet card. To effectively control frame transmission from ONUs to OLT EPON can use Multi-Point Control Protocol(MPCP) with additional control functions in addition to Media Access Control(MAC) protocol function. For EPON, many researches on intra- and inter-ONU scheduling algorithms have been performed. Among the inter-ONU scheduling algorithms, IPS(Interleaved Polling with Stop) based on polling scheme is efficient because OLT assigns available time portion to each ONU given the request information from all ONUs. Since the IPS needs an idle time period on uplink between two consecutive frame transmission periods, it wastes time without frame transmissions. In this paper, we propose a dynamic bandwidth allocation algorithm to increase the channel utilization on uplink and evaluate its performance using simulations. The simulation results show that the proposed Two-phase Cycle Danamic Bandwidth Allocation(TCDBA) algorithm improves the throughput about 15%, compared with the IPS and Fast Gate Dynamic Bandwidth Allocation(FGDBA). Also, the average transmission time of the proposed algorithm is lower than those of other schemes.

Utility Function-Based Scheduling in a Multi-Ship Network with Coordinated Multi-Point Transmission (협력적 다중 선박 네트워크에서 유틸리티 함수 기반의 스케줄링 기법)

  • Kim, Yunsung;Lee, Seong Ro;So, Jaewoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.538-545
    • /
    • 2014
  • This paper proposes a coordinated multi-point (CoMP) based dynamic transmission scheme in a downlink multi-ship network, where a central ship selects a ship in order to maximize the utility function. The proposed scheduling scheme dynamically decides to the usage of the coordinated multi transmissions and selects a user to be served for every frame, in order to the utility function on the basis of the throughput and fairness. In particular, the proposed utilify function based scheduling scheme aims to increase the quality of service of ships at the edge of cells. Under the proportional fair scheduling, the simulation results show that the proposed utility function-based scheduling improves the throughput of the ships at the cell edge with the little sacrifice of the system capacity.

QA-MAC: QoS-Aware MAC Protocol for Wireless Sensor Networks

  • Kim, Seong-Cheol;Park, Hyun-Joo
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.223-227
    • /
    • 2010
  • In this paper, we present a QoS-aware MAC protocol (QA-MAC) for cluster based wireless sensor networks (WSNs). QA-MAC is a TDMA-based scheduling protocol that minimizes the energy consumption in multi-hop WSNs and provides Quality of Service (QoS). A dynamic scheduling algorithm according to the number of member nodes, node traffics, and traffic priorities is suggested. The selected cluster head allocates time slots for all member nodes in the first TDMA schedule period of each round. During the second schedule period in each round, the cluster head makes a schedule for all data transmission. The proposed QA-MAC (QoS-Aware MAC) could save energy, reduce transmission delay, and support QoS.

A Real-Time MAC Protocol with Extended Backoff Scheme for Wireless Sensor Networks

  • Teng, Zhang;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.341-346
    • /
    • 2011
  • Wireless sensor networks (WSNs) are formed by a great quantity of sensor nodes, which are consisted of battery-powered and some tiny devices. In WSN, both efficient energy management and Quality of Service (QoS) are important issues for some applications. Real-time services are usually employed to satisfy QoS requirements in critical environment. This paper proposes a real-time MAC (Medium Access Control) protocol with extended backoff scheme for wireless sensor networks. The basic idea of the proposed protocol employs (m,k)-firm constraint scheduling which is to adjust the contention window (CW) around the optimal value for decreasing the dynamic failure and reducing collisions DBP (Distant Based Priority). In the proposed protocol, the scheduling algorithm dynamically assigns uniform transmitting opportunities to each node. Numerical results reveal the effect of the proposed backoff mechanism.

A Heuristic for Scheduling Production of Components at a Single Facility (단일설비 생산체제에서 부품의 일정계획에 관한 발견적 기법)

  • Gim, Bong-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.2
    • /
    • pp.31-38
    • /
    • 1994
  • We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.

  • PDF

A Heuristic for Sequencing and Scheduling of Multiple Feedstock Biogas Production Systems (다수의 Feedstock을 이용하는 메탄가스 생산시스템의 일정계획에 관한 발견적 기법)

  • Gim, Bong-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.1
    • /
    • pp.155-164
    • /
    • 1996
  • Biomass to methane via anaerobic digestion conversion is a good supply method of substitutable energy resources. The economic viability of this technology is contingent upon managing the production facilities in a cost effective manner. The problem is to determine the batch production sequence as well as the batch residence times in the digester so as to maximize total gas production over a given planning horizon. The problem is difficult to solve since the batch sequencing decisions and the batch residence time decisions cannot be isolated. This paper developes a heuristic algorithm which is based on a dynamic programming procedure for the multiple feedstock sequencing and scheduling biogas production systems and demonstrates to yield good results.

  • PDF

A Short Term Hydro-Thermal Scheduling using Evolutionary Programming (진화 프로그래밍기법을 적용한 단기 수화력 운용)

  • Kim, Jae-Chul;Baek, Young-Sik
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.8
    • /
    • pp.917-923
    • /
    • 1999
  • This paper proposes an efficient method of hydro-thermal scheduling in coordination with head variation and hydraulically coupled plants using Evolutionary Programing(EP). Based on the EP technique, the proposed algorithm is capable of determining the global optimal solutions. The constraints such a power balance condition, water available condition and transmission losses are embedded and satisfied throughout the proposed EP approach. The effectiveness of the proposed approach is demonstrated on the test systems and compared to those of other method. The results show that the new approach obtains a more highly optimal solutions than the conventional other methods such as newton-raphson method, Dynamic Programming(DP), LU factorization.

  • PDF