A Proposed “Modified Filtering Algorithm” (MFA) for Secured Data by Identifying the Delay and Effective Completion Time of Tasks in Cloud
A. Manimuthu1, G. Murugaboopathi2

1A. Manimuthu, Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore (Tamil Nadu), India.
2Dr. G. Murugaboopathi, Associate Professor, Department of Computer Science and Engineering, Kalasalingam University, Krishnankoil (Tamil Nadu), India.
Manuscript received on 26 April 2019 | Revised Manuscript received on 03 May 2019 | Manuscript Published on 08 May 2019 | PP: 551-558 | Volume-7 Issue-5S3 February 2019 | Retrieval Number: E11980275S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: In today’s era, cloud computing has played a major role in providing various services and capabilities to a number of researchers around the globe. One of the major problems we face in cloud is to identify the various constraints related with the delay in the Task accomplishment as well as the enhanced approach to execute the task with high throughput. Many researches have shown that although having an optimum solution is almost impossible but having a sub-optimal solution using heuristic algorithms seems possible. In this paper, we propose “Modified Filtering Algorithm” for task scheduling on cloud environment, compared with previously used particle swarm optimization (PSO), heuristic approaches, and modified PSO algorithm for efficient task scheduling. Comparing all these three algorithms, we aim to generate an optimal schedule in order to minimize completion time of task execution.
Keywords: Cloud Environment, Modified Filtering Algorithm (MFA), Heuristic Algorithms, PSO, Task Scheduling, Quantum Time.
Scope of the Article: Algorithm Engineering