Efficient Workflow Management Algorithms for Optimization the Scheduling in Grid Computing
نویسندگان
چکیده
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, scheduling, security problems, information management and so on. Scheduling is the use to achieve high performance in grid environments. This paper explains one of the large growing optimization algorithms, the ant colony algorithm and genetic algorithm in Grid computing. It uses different heterogeneous systems for sharing large-scale resources to solve very large scientific problems. In this paper, two optimization algorithms are used for scheduling techniques in grid computing. It aims to find a suitable allocation of resources for each job with the comparison of hybrid ACO and GA. We compared our proposed hybrid results with previous results in terms of execution time & execution cost which proves that our new hybrid approach has better results.
منابع مشابه
Data Replication-Based Scheduling in Cloud Computing Environment
Abstract— High-performance computing and vast storage are two key factors required for executing data-intensive applications. In comparison with traditional distributed systems like data grid, cloud computing provides these factors in a more affordable, scalable and elastic platform. Furthermore, accessing data files is critical for performing such applications. Sometimes accessing data becomes...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملWorkflow Scheduling Algorithms in Grid Computing
Grid computing is a process of aggregate the functionality of different geographically resources and provide services to the user. Scheduling is most popular research area in grid computing for achieving high performance. In scheduling, tasks are assigning to resources and maintain the execution. Dependencies constraints are need to preserve for workflow scheduling in grid computing. In this pa...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کامل