Design of Efficient Combinatorial Workflow Scheduling Algorithm for Cloud Computing

dc.contributor.guideRohitash Kumar Banyal
dc.coverage.spatial
dc.creator.researcherNeeraj Arora
dc.date.accessioned2024-02-22T08:21:58Z
dc.date.available2024-02-22T08:21:58Z
dc.date.awarded2023
dc.date.completed2023
dc.date.registered2017
dc.description.abstractCloud computing, a fast expanding technology, deliveres services on demand via In- newlineternet. In recent times it is gaining popularity in information technology due to the advance- newlinements like on-demand processing, resource sharing, pay per use, etc. There are several cloud newlinecomputing issues like security, QoS management, data center energy consumption, scaling, newlineetc. Scheduling is among the several challenging problems, where several tasks need to newlinebe assigned to resources to optimize the quality of service parameters. This will require a newlinesuitable scheduling algorithm. newlineWorkflow scheduling is considered an NP-hard problem and has a significant issue in newlinethe cloud environment. Finding solutions in the workflow scheduling is even difficult com- newlinepared to task scheduling as the tasks are dependent on each other in the workflow. Finding newlinethe polynomial-time solutions for workflow scheduling problems is difficult with most of newlinethe existing algorithms designed for traditional computing platforms. Some existing meta- newlineheuristics algorithms proposed for workflow scheduling problems are stuck in the local op- newlinetimal solution and fail to give the global optimal solution. newlineIn this thesis, a new single objective model-based hybrid metaheuristic algorithm, newlinenamed HPSOGWO, is proposed. This is the hybrid version of two well-known algorithms, newlineParticle Swarm Optimization (PSO) and Grey Wolf Optimisation (GWO). The proposed al- newlinegorithm takes advantage of the standard PSO and GWO algorithms and does not stick to newlinethe local optimal solution. The proposed algorithm (HPSOGWO) was tested to reduce the newlinetotal execution cost and total execution time of the dependent tasks in the cloud computing newlineenvironment. The experiment results show that the HPSOGWO outperformed compared to newlinethe standard PSO and GWO algorithm in total execution cost and total execution time. newline
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions
dc.format.extent8076 kb
dc.identifier.urihttp://hdl.handle.net/10603/546731
dc.languageEnglish
dc.publisher.institutionComputer Engineering
dc.publisher.placeKota
dc.publisher.universityRajasthan Technical University, Kota
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Information Systems
dc.subject.keywordEngineering and Technology
dc.titleDesign of Efficient Combinatorial Workflow Scheduling Algorithm for Cloud Computing
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 13
Loading...
Thumbnail Image
Name:
80_recommendation.pdf
Size:
182.43 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
abstract.pdf
Size:
72.89 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
annexures.pdf
Size:
213.71 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter 1.pdf
Size:
1.66 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter 2.pdf
Size:
389.71 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: