CCSDS Advanced Orbiting Systems, Data Links Protocol: Study on Virtual Channels Scheduling Algorithm

2008 ◽  
Author(s):  
Qingli Liu ◽  
Chengsheng Pan ◽  
Guoren Wang ◽  
Wei Liu
Keyword(s):  
Scheduling Algorithm ◽  
Virtual Channels ◽  
Data Links ◽  
Protocol Study ◽  
Orbiting Systems

scholarly journals A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Ye Tian ◽  
Qingfan Li ◽  
Yongxin Feng ◽  
Xiaoling Gao
Keyword(s):  
Time Slot ◽  
Scheduling Algorithm ◽  
Virtual Channel ◽  
Channel Utilization ◽  
Virtual Channels ◽  
Broad Applicability ◽  
Movable Boundary ◽  
Physical Channel ◽  
Utilization Ratio ◽  
Synchronous Time

A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.

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.

Sign in / Sign up

Export Citation Format

Share Document