• Title/Summary/Keyword: 혼합 스케줄링 알고리즘

Search Result 17, Processing Time 0.021 seconds

Minimizing the Total Stretch when Scheduling Flows of Divisible Requests without Interruption (총 스트레치 최소화를 위한 분할 가능 리퀘스트 흐름 스케줄링)

  • Yoon, Suk-Hun
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.1
    • /
    • pp.79-88
    • /
    • 2015
  • Many servers, such as web and database servers, receive a continual stream of requests. The servers should schedule these requests to provide the best services to users. In this paper, a hybrid genetic algorithm is proposed for scheduling divisible requests without interruption in which the objective is to minimize the total stretch. The stretch of a request is the ratio of the amount of time the request spent in the system to its response time. The hybrid genetic algorithm adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms. Extensive computational experiments have been conducted to compare the performance of the hybrid genetic algorithm with that of genetic algorithms.

A Study on the Delay Adaptive Traffic Scheduling for QoS of Traffic Type (트래픽 유형에 따른 QoS 보장을 위한 지연 적응적인 스케줄링에 관한 연구)

  • 이상호;오영환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12B
    • /
    • pp.1988-1995
    • /
    • 2000
  • ATM 망에서 제공되고 있는 음성, 영상, 데이터와 같은 다양한 서비스는 사용자의 만족도를 수용할 수 있어야 한다는 것을 전제조건으로 한다. 이러한 기본적인 요구사항을 충족시키기 위해서는 노드대 노드간의 자원관리와 오류제어 및 다양한 트래픽의 특성을 고려한 전송 순서의 결정에 해당하는 스케줄링 방법이 요구되어 진다. 본 논문에서는 이러한 기술 요소 중에서 트래픽 설정 단계에서 제공되는 트래픽 특성 및 QoS(Quality of Service) 정보를 바탕으로 교환 노드에서 발생되는 전달 지연 시간에 적응적인 스케줄링 방식을 제시하였다. 이 방식은 멀티미디어 서비스와 같이 혼합된 트래픽 특성을 갖는 구조에서 트래픽 구성비율에 따라 적용되는 지연 여유치를 매우 융통성 있고 효과적으로 조절할 수 있다. 성능분석을 위하여 기존의 스케줄링 방식인 WFQ (Weighted Fair Queueing) 방식과 제안한 스케줄링 방식의 수학적인 분석을 수행하였으며 이 두 방식의 결과식을 비교하여 교환노드에서의 평균 지연과 셀 처리에 관한 성능을 분석하였다. 그리고 수학적 분석에 대한 검증으로는 Simulation tool ARENA 3.0을 이용하여 제안한 알고리즘의 Worst case와 기존의 알고리즘의 성능을 비교하였다.

  • PDF

Hybrid Scheduling Algorithm based on DWDRR using Hysteresis for QoS of Combat Management System Resource Control

  • Lee, Gi-Yeop
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.21-27
    • /
    • 2020
  • In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

Dynamic Scheduling Method of Wireless Control System in Factory Environment (공장 환경에서의 무선 제언 시스템을 위한 센서네트워크의 동적 스케줄링 기법에 대한 연구)

  • Lee, Jung-Il;Kim, Dong-Sung
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.2
    • /
    • pp.45-54
    • /
    • 2008
  • In this paper, a dynamic GTS scheduling method based on IEEE 802.15.4 is proposed for wireless control system. The proposed method can guarantee a transmission of real-time periodic and sporadic data within the time frame in factory environment. The modified superframe of IEEE 802.15.4 was used to the dynamic scheduling method of real-time mixed traffic(periodic data, sporadic data, and non real-time message). By separating CFP and CAP properly, the sporadic and non real-time messages are transmitted effectively and guarantee real-time transmission within a deadline. The simulation results show the improvement of real-time performance of periodic and sporadic data.

Minimizing the total completion time in a two-stage flexible flow shop (2 단계 유연 흐름 생산에서 평균 완료 시간 최소화 문제)

  • Yoon, Suk-Hun
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.8
    • /
    • pp.207-211
    • /
    • 2021
  • This paper addresses a two-stage flexible flow shop scheduling problem in which there is one machine in stage 1 and two identical machines in stage 2. The objective is the minimization of the total completion time. The problem is formulated by a mixed integer quadratic programming (MIQP) and a hybrid simulated annealing (HSA) is proposed to solve the MIQP. The HSA adopts the exploration capabilities of a genetic algorithm and incorporates a simulated annealing to reduce the premature convergence. Extensive computational tests on randomly generated problems are carried out to evaluate the performance of the HSA.

Power-Aware Scheduling for Mixed Real-Time Tasks (주기성과 산발성 태스크가 혼합된 시스템을 위한 전력절감 스케줄링 기법)

  • Gong, Min-Sik;Jeong, Gun-Jae;Song, Ye-Jin;Jung, Myoung-Jo;Cho, Moon-Haeng;Lee, Cheol-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.83-93
    • /
    • 2007
  • In this paper, we address a power-aware scheduling algorithm for a mixed real-time system which consists of periodic and sporadic tasks, each of which is characterized by its minimum period, worst-case execution requirement and deadline. We propose a dynamic voltage scaling algorithm called DVSMT(DVS for mixed tasks), which dynamically scales down the supplying voltage(and thus the frequency) using on-line distribution of the borrowed resources when jobs complete while still meeting their deadlines. With this scheme, we could reduce more energy consumption. As the proposed algorithm can be easily incorporated with RTOS(Real-Time Operating System), it is applicable for handhold devices and sensor network nodes that use a limited battery power. Simulation results show that DVSMT saves up 60% more than the existing algorithms both in the periodic-task and mixed-task systems.

A development of an Optimization-Based Flight Scheduler and Its Simulation-Based Application to Real Airports (최적화 기법 기반의 항공기 스케줄러 개발 및 실제 공항의 수치적 모사)

  • Ryu, MinSeok;Song, Jae-Hoon;Choi, Seongim
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.41 no.9
    • /
    • pp.681-688
    • /
    • 2013
  • Several problems caused by inevitable increment of airplane have been issued. The most effective solution to solve the issues is considered as establishing appropriate Air Traffic Management (ATM) that reduces aircraft's delay at an airport and intensify the airport's capacity. The purpose of this paper is to produce the optimum aircraft schedules that maximize the aircraft throughput by smooth air traffic flow near terminal area of an airport In this paper, mathematical formulations of the scheduling problem are firstly specified. Based on the mathematical modelling, an Optimization-Based Flight Scheduler that provides the optimum flight schedules for arriving aircraft is developed by introducing the Mixed Integer Linear Programming(MILP) and the Genetic Algorithms(GA). With this scheduler, we calculated the optimum schedules to compare to real schedule data from an Incheon Airport. As a result, it is validated that aircraft throughput produced by the optimum schedule is much better than that of the schedule from the Incheon airport. The optimization-based flight scheduler is expected to deal with problems due to the aircraft saturation in near future.

A Scheduling Scheme using Partial Channel Information for Ad-hoc Networks (Ad-hoc 망에서 채널의 부분정보를 이용한 스케줄링 기법)

  • 신수영;장영민
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11B
    • /
    • pp.1031-1037
    • /
    • 2003
  • A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

A GFR Service of fairness Improvement Algorithm in hybrid Network (혼합 망에서 GFR 서비스의 공평성 향상 알고리즘)

  • 송선희;석경휴;김문환;김철영;배철수;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.386-390
    • /
    • 2004
  • 유무선 혼합 망에서 GFR서비스의 최소대역, 효율 및 트래픽 제어를 위한 버퍼관리 기법 등을 유무선 혼합망의 셀기반 네트워크에서 가중치를 높이는 시뮬레이션을 통해 공평성을 입증하는 연구를 한다. GFR서비스는 TCP/IP 패킷의 품질보장과 베스트 에포트 트래픽에 대한 최소의 대역폭 보장을 하며, 가용 대역폭에 대한 공평성 있는 대역할당을 지원해야 하기 때문에 버퍼관리를 통한 셀 폐기와 셀 스케줄링 둥이 중요한 요소이다. 본 논문에서는 유무선 혼합 네트워크에서 MCR을 보장하기 위하여 버퍼의 사용 가능한 영역의 활성 VC에 각 VC가중치를 비례해 할당하는 per-VC 어카운트에 기초한 트래픽 제어의 버퍼관리에 대한 유동적 WBA알고리즘을 제안하고 GFR 서비스의 효율 및 공평성을 유무선 혼합 망 셀 기반의 스위치를 이용하여 시뮬레이션으로 결과를 보인다.

  • PDF

Adaptive Hybrid Genetic Algorithm Approach to Multistage-based Scheduling Problem in FMS Environment (FMS환경에서 다단계 일정계획문제를 위한 적응형혼합유전 알고리즘 접근법)

  • Yun, Young-Su;Kim, Kwan-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.3
    • /
    • pp.63-82
    • /
    • 2007
  • In this paper, we propose an adaptive hybrid genetic algorithm (ahGA) approach for effectively solving multistage-based scheduling problems in flexible manufacturing system (FMS) environment. The proposed ahGA uses a neighborhood search technique for local search and an adaptive scheme for regulation of GA parameters in order to improve the solution of FMS scheduling problem and to enhance the performance of genetic search process, respectively. In numerical experiment, we present two types of multistage-based scheduling problems to compare the performances of the proposed ahGA with conventional competing algorithms. Experimental results show that the proposed ahGA outperforms the conventional algorithms.

  • PDF