Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture

2012 ◽  
Author(s):  
Jianfei Zhang ◽  
Zhiyi Fang ◽  
Hyung Jae Chang ◽  
S.Q. Zheng
Keyword(s):  
Scheduling Algorithm ◽  
Switch Architecture

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

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