A Study on Scientific Workflow Dynamic Scheduling Algorithms in Cloud |
Author(s): |
A. Hemapriya , NGM College,Pollachi; Dr. Antony Selvadoss Thanamani, NGM College,Pollachi |
Keywords: |
Mobile Ad-hoc Network, Security Issues, Routing Protocols, Attacks |
Abstract |
Cloud computing is one of the rising areas that has picked up notoriety in the ongoing years. It offers benefit – arranged IT administrations to the clients worldwide over the internet. Therefore, booking errands effectively and powerfully is a basic issue to be solved. There are many planning calculations that are utilized in distributed computing however the greater part of them are concentrating on limiting time and cost and some of them focus on expanding issue tolerance. However, not very many booking calculations that thinks about time, cost, and adaptation to internal failure at the equivalent time. One of the most difficult issues in Cloud figuring is the work process planning the issue of satisfying the Quality of Service of the clients and also limiting the expense of work processes executions. Work process booking is one of the immense issues in distributed computing condition. This paper abridged diverse sorts of booking calculations and analyze their different parameters. Existing work process calculations does not involve the execution time. In this way, there is a need to actualize another unique planning calculation that can limit the execution time in cloud condition. |
Other Details |
Paper ID: IJSRDV6I100391 Published in: Volume : 6, Issue : 10 Publication Date: 01/01/2019 Page(s): 813-819 |
Article Preview |
|
|