scholarly journals Implementation of a New Time-Constraint Approach for Handling Scheduling Problems in Computational Grid

2021 ◽  
Author(s):  
Thomas Ibharalu ◽  
Temitope Odeyemi
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Computational Grid ◽  
Time Constraint ◽  
Communication Link ◽  
Scheduling Problems ◽  
Grid Scheduling ◽  
Constraint Approach ◽  
New Time

It is a new grid scheduling algorithm that uses ratio formula for task scheduling and equal makes optimum use of available research base on criteria such as resource size, speed of communication link and so on

scholarly journals Implementation of a New Time-Constraint Approach for Handling Scheduling Problems in Computational Grid

2021 ◽  
Author(s):  
Thomas Ibharalu ◽  
Temitope Odeyemi
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Computational Grid ◽  
Time Constraint ◽  
Communication Link ◽  
Scheduling Problems ◽  
Grid Scheduling ◽  
Constraint Approach ◽  
New Time

It is a new grid scheduling algorithm that uses ratio formula for task scheduling and equal makes optimum use of available research base on criteria such as resource size, speed of communication link and so on

A Security Prioritized Computational Grid Scheduling Model

2011 ◽  
pp. 90-100
Author(s):  
Rekha Kashyap ◽  
Deo P. Vidyarthi
Keyword(s):  
Scheduling Algorithm ◽  
Computational Grid ◽  
Security Requirement ◽  
Computational Power ◽  
Grid Scheduling ◽  
System Utilization ◽  
Scheduling Model ◽  
Grid Resources

Grid supports heterogeneities of resources in terms of security and computational power. Applications with stringent security requirement introduce challenging concerns when executed on the grid resources. Though grid scheduler considers the computational heterogeneity while making scheduling decisions, little is done to address their security heterogeneity. This work proposes a security aware computational grid scheduling model, which schedules the tasks taking into account both kinds of heterogeneities. The approach is known as Security Prioritized MinMin (SPMinMin). Comparing it with one of the widely used grid scheduling algorithm MinMin (secured) shows that SPMinMin performs better and sometimes behaves similar to MinMin under all possible situations in terms of makespan and system utilization.

scholarly journals Effective task scheduling algorithm in cloud computing with quality of service alert bees and grey wolf optimization

2022 ◽  
Vol 25 (1) ◽  
pp. 550
Author(s):  
Nidhi Bansal ◽  
Ajay Kumar Singh
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Technology Development ◽  
Mathematical Proof ◽  
Scheduling Algorithm ◽  
Real Life ◽  
Optimization Method ◽  
Numerical Comparison ◽  
Scheduling Problems ◽  
Grey Wolf

Quality-based services are an indicative factor in providing a meaningful measure. These measures allow labeling for upcoming targets with a numerical comparison with a valid mathematical proof of reading and publications. By obtaining valid designs, organizations put this measure into the flow of technology development operations to generate higher profits. Since the conditions were met from the inception of cloud computing technology, the market was captured heavily by providing support through cloud computing. With the increase in the use of cloud computing, the complexity of data has also increased greatly. Applying natural theory to cloud technology makes it a fruit cream. Natural methods often come true, because survival depends on the live events and happenings, so using it in real life as well as any communication within technology will always be reliable. The numerical results are also showing a better value by comparing the optimization method. Finally, the paper introduces an adaptation theory with effective cloudsim coding of honey bees and grey wolf in conjunction with their natural life cycle for solving task scheduling problems. Using adapted bees improved the results by 50% compared with the original bees and secondly by honeybees and grey wolf improved 60%.

scholarly journals A Synthesized Heuristic Task Scheduling Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yanyan Dai ◽  
Xiangli Zhang
Keyword(s):  
Task Scheduling ◽  
Resource Selection ◽  
Scheduling Algorithm ◽  
Scheduling Problems ◽  
Task Scheduling Algorithm ◽  
Task Duplication ◽  
Current Task ◽  
The Impact ◽  
Made In ◽  
Selection Phase

Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks with less predecessors to schedule. In resource selection phase, the algorithm is selected task duplication to reduce the interresource communication cost, besides forecasting the impact of an assignment for all children of the current task permits better decisions to be made in selecting resources. The algorithm proposed is compared with STDH, PEFT, and HEFT algorithms through randomly generated graphs and sets of task graphs. The experimental results show that the new algorithm can achieve better scheduling performance.

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