Deadline Aware Prioritized Task Scheduling Algorithm in Cloud Computing
R. Barani1, S. Suguna2
1R. Barani, Assistant Professor, Department of Computer Science, Annai Women’s College, Karur (Tamil Nadu), India.
2S. Suguna, Assistant Professor, Department of Computer Science, Sri Meenakshi Govt. Arts College for Women (A), Madurai (Tamil Nadu), India.
Manuscript received on 12 October 2019 | Revised Manuscript received on 21 October 2019 | Manuscript Published on 02 November 2019 | PP: 815-818 | Volume-8 Issue-2S11 September 2019 | Retrieval Number: B11320982S1119/2019©BEIESP | DOI: 10.35940/ijrte.B1132.0982S1119
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: Cloud Computing is a computing Paradigm in which services are provided by service providers on pay-per-use. Task Scheduling is the challenging issue in cloud computing. Task scheduling refers to allocating tasks to available resources to achieve better performance of the system. Here we have proposed a Heuristics algorithm to schedule tasks in given resources which satisfies the QoS of system taking Priority and Deadline of tasks as parameters. Our algorithm is compared with existing algorithms like EDF and TLD algorithms. Our algorithm provides better makespan, increases throughput and utilize resources well compared to existing algorithms.
Keywords: Task Scheduling – TLD Algorithm –EDF Algorithm –Proposed Algorithm –Comparative Analysis.
Scope of the Article: Cloud Computing