A scheduling algorithm for controlling of service rate and burst

2012 ◽  
Author(s):  
Mahmoud Daneshvar Farzanegan ◽  
Hossein Saidi ◽  
Mehdi Mahdavi
Keyword(s):  
Scheduling Algorithm ◽  
Service Rate

Optimal Scheduling with Maximum Position Shift (MPS) Constraints: A Runway Scheduling Application

1998 ◽  
Vol 51 (2) ◽  
pp. 250-266 ◽  
Author(s):  
Dionyssios A. Trivizas
Keyword(s):  
Traffic Control ◽  
Queueing System ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Service Rate ◽  
Threshold Time ◽  
Optimal Dynamic ◽  
Position Shift ◽  
Airport Runway ◽  
Time Of Operation

This paper presents results from a doctoral dissertation (reference 12), on the problem of scheduling with Maximum Position Shift (MPS) constraints. The problem typically arises in a queueing system, when the service rate depends on the sequence in which customers are handled by the server. Such a queueing system is the airport runway system, where it has been shown (references 3, 10, 12) that rearranging the sequence of landings and takeoffs affects the runway capacity – that is, the rate of runway operations. An optimal Dynamic Programming (DP) scheduling algorithm is developed that takes as input the set of currently known flights, their desired time of operation, basis of the First Come First Served (FCFS) sequence, and a matrix of Air Traffic Control (ATC) minimum time separations, in order to produce an optimal schedule defined as runway and threshold time assignments maximizing runway capacity.

scholarly journals A hybrid Method to augment the efficiency of Distributed Computing System by DAG -Using Finest Task Allocation with Dual Mode Processors

2019 ◽  
Vol 8 (11) ◽  
pp. 4275-4284
Keyword(s):  
Distributed Computing ◽  
Task Allocation ◽  
Scheduling Algorithm ◽  
Computing System ◽  
Service Rate ◽  
Additional Parameter ◽  
Computing Environment ◽  
Dual Mode ◽  
New Approach ◽  
Heterogeneous Distributed Computing

Distributed computing system creates or provides a platform having multiple computing nodes linked in a specified manner. On the basis of literature review of last few decades it has been noticed that most of distributed computing researchers have shown their effort to maintain load balancing between processors ,effective task scheduling and optimizing different parameters affecting execution cost and throughput .With these above scenario an additional parameter “Self reconfiguration of CPU” is also a countable parameter to augment the efficiency of distributed computing system .Through this research paper we want to present new approach of adaptive scheduling algorithm which is the mix output of effective task allocation to processor involved in computing and self-reconfiguration of those processors as per need of computing. By this proposed method we will optimize the execution cost, service rate and maximize the throughput as an outcome of organized processors consist in heterogeneous distributed computing system, resulting provide the considerable enhancement in the performance of Distributed computing environment.

A Scheduling Algorithm for Bursty Traffic: Controlling of Service Rate and Burst

2014 ◽  
Vol 39 (6) ◽  
pp. 4753-4764 ◽  
Author(s):  
Mahmoud Daneshvar Farzanegan ◽  
Hossein Saidi ◽  
Mehdi Mahdavi
Keyword(s):  
Scheduling Algorithm ◽  
Service Rate ◽  
Bursty Traffic

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

New Scheduling Algorithm Proposed for Real Time Traffic Over LTE Femto-Cell

2015 ◽  
Vol 5 (6) ◽  
pp. 383
Author(s):  
Mohammed Mahfoudi ◽  
Moulhime El Bekkali ◽  
Abdellah Najid ◽  
Mohamed El Ghazi ◽  
Said Mazer
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Real Time Traffic

Zero Forcing Beamforming Based Coordinated Scheduling Algorithm for Downlink Coordinated Multi-Point Transmission System

2015 ◽  
Vol E98.B (2) ◽  
pp. 352-359 ◽  
Author(s):  
Ping WANG ◽  
Lei DING ◽  
Huifang PANG ◽  
Fuqiang LIU ◽  
Nguyen Ngoc VAN
Keyword(s):  
Scheduling Algorithm ◽  
Transmission System ◽  
Zero Forcing ◽  
Coordinated Scheduling
Sign in / Sign up

Export Citation Format

Share Document