Please use this identifier to cite or link to this item:
https://elibrary.tucl.edu.np/handle/123456789/7486
Title: | Task Scheduling in Grid Computing Using Genetic Algorithm |
Authors: | Prajapati, Ujjwal |
Keywords: | Task Scheduling, Grid Computing, Distributed Computing,;Makespan, Economic Cost, Genetic Algorithm |
Issue Date: | Nov-2014 |
Publisher: | Pulchowk Campus |
Institute Name: | Institute of Engineering |
Level: | Masters |
Citation: | MASTER OF SCIENCE IN COMPUTER SYSTEM AND KNOWLEDGE ENGINEERING |
Abstract: | Task scheduling is a key problem in Grid computing in order to benefit from the large computing capacity of such systems. The need of allocating a number of tasks to different resources for the efficient utilization of resources with minimal completion time and economic cost is the essential requirement in such systems. The problem is multi-objective in its general formation, with the objectives being the minimization of makespan and flowtime of the system along the economic cost. An optimal scheduling could be achieved minimizing the completion time and economic cost using the heuristic approach, which is chosen to be Genetic Algorithm. The ability of Genetic Algorithm to simultaneously search different regions of a solution space makes it possible to find a diverse set of solutions for difficult problems.Each individual is represented as possible solution. The solutions are the schedulers for efficiently allocating jobs to resources in a Grid system. |
Description: | Task scheduling is a key problem in Grid computing in order to benefit from the large computing capacity of such systems. |
URI: | https://elibrary.tucl.edu.np/handle/123456789/7486 |
Appears in Collections: | Electronics and Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Task Scheduling in Grid Computing using Genetic Algorithm069 MSCS 669.pdf | 787.37 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.