Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Certain Investigation on Improved pso Algorithm for Workflow Scheduling in Cloud Computing Environments
Type
Physical Book
Publisher
Author
Language
English
Pages
44
Format
Paperback
ISBN13
9783960671923

Certain Investigation on Improved pso Algorithm for Workflow Scheduling in Cloud Computing Environments

Sadhasivam Narayanan (Author) · Anchor Academic Publishing · Paperback

Certain Investigation on Improved pso Algorithm for Workflow Scheduling in Cloud Computing Environments - Sadhasivam Narayanan

Cheaper New Book Imported to Netherlands
Delivery: 10 Sep - 14 Sep Shipping: 13 to 14 business days.
€ 44,56
Faster New Book Imported to Netherlands
Delivery: 27 Aug - 01 Sep Shipping: 4 to 5 business days.
€ 63,69
Import costs and 9% BTW included in the price ✅
€ 44,56

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Certain Investigation on Improved pso Algorithm for Workflow Scheduling in Cloud Computing Environments"

Cloud computing is a new prototype for enterprises which can effectively assist the execution of tasks. Task scheduling is a major constraint which greatly influences the performance of cloud computing environments. The cloud service providers and consumers have different objectives and requirements. For the moment, the load and availability of the resources vary dynamically with time. Therefore, in the cloud environment scheduling resources is a complicated problem. Moreover, task scheduling algorithm is a method by which tasks are allocated or matched to data center resources. All task scheduling problems in a cloud computing environment come under the class of combinatorial optimization problems which decide searching for an optimal solution in a finite set of potential solutions. For a combinatorial optimization problem in bounded time, exact algorithms always guarantee to find an optimal solution for every finite size instance. These kinds of problems are NP-Hard in nature. Moreover, for the large scale applications, an exact algorithm needs unexpected computation time which leads to an increase in computational burden. However, the absolutely perfect scheduling algorithm does not exist, because of conflicting scheduling objectives. Therefore, to overcome this constraint heuristic algorithms are proposed. In workflow scheduling problems, search space grows exponentially with the problem size. Heuristics optimization as a search method is useful in local search to find good solutions quickly in a restricted area. However, the heuristics optimization methods do not provide a suitable solution for the scheduling problem. Researchers have shown good performance of metaheuristic algorithms in a wide range of complex problems. In order to minimize the defined objective of task resource mapping, improved versions of Particle Swarm Optimization (PSO) are put in place to enhance scheduling performance with less computational burden. In recent years, PSO has been success

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews