Grid Scheduling Using PSO with SPV Rule
نویسندگان
چکیده
Grid computing can be defined as applying the resources of many computers in a network to a problem which requires a great number of computer processing cycles or access to large amounts of data. However, in the field of grid computing scheduling of tasks is a big challenge. The task scheduling problem is the problem of assigning the tasks in the system in a manner that will optimize the overall performance of the application, while assuring the correctness of the result. Each day new algorithms are proposed for assigning tasks to the resources. This is also a boon for the grid computing. In this paper we use the technique of Particle Swarm Optimization (PSO) with SPV (Shortest position value) rule to solve the task scheduling problem in grid computing. The aim of using this technique is use the given resources optimally and assign the task to the resources efficiently. The simulated results show that PSO with SPV rule proves to be a better algorithm when applied to resource allocation and disk scheduling in grid computing.
منابع مشابه
Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling
Grid computing which is based on the high performance computing environment, basically used for solving complex computational demands. In the grid computing environment, scheduling of tasks is a big challenge. The task scheduling problem can be defined as a problem of assigning the number of resources to tasks where number of resources is less than the number of available tasks. Particle swarm ...
متن کاملP. MATHIYALAGAN et al.: ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clus...
متن کاملDNA Sequence Assembly using Particle Swarm Optimization
DNA sequence assembly problem is a very complex problem of computational biology. DNA sequence assembly is a NP hard problem there is no single solution available for this kind of problems. DNA sequence assembly refers to aligning and merging fragments of a much longer DNA sequence in order to reconstruct the original sequence. In this paper a solution is proposed for DNA sequence assembly prob...
متن کاملA Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...
متن کاملA Particle Swarm Optimization Approach for the Earliness-Tardiness No-Wait Flowshop Scheduling Problem
In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...
متن کامل