Level-wise Scheduling Algorithm for Fat Tree Interconnection Networks

2006 ◽  
Author(s):  
Zhu Ding ◽  
Raymond Hoare ◽  
Alex Jones ◽  
Rami Melhem
Keyword(s):  
Interconnection Networks ◽  
Scheduling Algorithm

A PARALLEL SCHEDULING ALGORITHM FOR TREE STRUCTURED INTERCONNECTION NETWORKS

1996 ◽  
Vol 06 (01) ◽  
pp. 45-54 ◽  
Author(s):  
MIN-YOU WU
Keyword(s):  
Load Balancing ◽  
Interconnection Networks ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Tree Topology ◽  
Alternative Strategy ◽  
Parallel Scheduling ◽  
High Quality ◽  
New Approach

Global parallel scheduling is a new approach for runtime load balancing. In parallel scheduling, all processors cooperate together to schedule work. Parallel scheduling accurately balances the load by using global load information. As an alternative strategy to the commonly used dynamic scheduling, it provides a high-quality, low-overhead load balancing. This paper presents a parallel scheduling algorithm for interconnection networks of the tree topology. This algorithm minimizes communications and maximize locality.

scholarly journals Dynamic Scheduling Algorithm for Variants of Hypercube Interconnection Networks

2017 ◽  
Vol 10 (25) ◽  
pp. 1-5
Author(s):  
Zaki Ahmad Khan ◽  
Jamshed Siddiqui ◽  
Mahfooz Alam ◽  
◽  
◽  
...  
Keyword(s):  
Interconnection Networks ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm

A contribution to parallelization of symbolic robot models

Robotica ◽  
1995 ◽  
Vol 13 (4) ◽  
pp. 411-421 ◽  
Author(s):  
N. Kirćanski ◽  
T. Davidović ◽  
M. Vukobratović
Keyword(s):  
Interconnection Networks ◽  
Robot Control ◽  
Scheduling Algorithm ◽  
Parallel Architectures ◽  
Interprocessor Communication ◽  
Heuristic Function ◽  
Feasible Schedule ◽  
Partial Schedule ◽  
Symbolic Method ◽  
Output Time

SummaryThis paper is focused on task scheduling in multiprocessor robot controllers. To minimize the input-output time delay our consideration is restricted to parallel architectures that include complete crossbar interconnection networks. In this paper, an efficient scheduling algorithm based on a heuristic function is considered. This function takes into account delays caused by interprocessor communication and minimizes both the execution time and the communication cost. Robot control computation based on a highly efficient customized symbolic method is decomposed into a large number of simple tasks, each involving a single floating-point operation. Starting with an empty partial schedule, each step of the search extends the current partial schedule by adding one of the tasks yet to be scheduled. The heuristic function used in the algorithm actively directs the search for a feasible schedule, i.e. it helps choose the task that extends the current partial schedule. To increase the computational rate we introduced overlapping of computations.

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