Extended Optimization Procedures for Static List based Task Scheduling Algorithms for He DCS
K. Vijaya Kumar1, E. Laxmi Lydia2, P. Amaranatha Reddy3
1K. Vijaya Kumar, Associate Professor, Department of Computer Science and Engineering, Vignan’s Institute of Engineering For Women College, Visakhapatnam (A.P), India.
2E. Laxmi Lydia, Associate Professor & Big Data Consultant, Department of Computer Science and Engineering, Vignan’s Institute of Engineering For Women College, Visakhapatnam (A.P), India.
3P. Amaranatha Reddy, Assistant Professor, Department of Computer Science & Engineering, VFSTR University, (Andhra Pradesh), India.
Manuscript received on 10 October 2019 | Revised Manuscript received on 19 October 2019 | Manuscript Published on 02 November 2019 | PP: 15-20 | Volume-8 Issue-2S11 September 2019 | Retrieval Number: B10030982S1119/2019©BEIESP | DOI: 10.35940/ijrte.B1003.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: No matter how powerful a single system is efficient at processing, there are still reasons to Control the power of multiple computational units. The Distributed computational system performs scheduling tasks achievedby the processors to minimize the execution time in any application.Despite the problem in determining NP-Complete the execution time in Scheduling isminimized.This paper identifies, a specific different algorithm Sorted Nodes in Leveled DAG Division (SNLDD)based on Task-Scheduling. The fundamental principle of this algorithm is to partition the data as a Directed Acyclic Graph (DAG) two stages and categorize each task of every stage in decreasing order depending upon the estimated size. Outcomes of the proposed algorithm are processed using correlative analysis and productive outcome with respect to HEFT with CPOP is implemented among existing algorithms. With respect to the comparative analysis of the outcomes, the performance of the suggested algorithm with SPOP implementsim proved execution in the aspect of speedup, effectiveness, complexity, and excellence. Further, a new algorithmic strategy SPOP and CPOP has been developed and executed in the proposed SNLDD in HEFT.
Keywords: Task Scheduling, Sorted Nodes in Leveled DAG Division, Superior Performance Optimization Procedure, Heterogeneous Earliest Finish Time, Critical Path on Processor.
Scope of the Article: Discrete Optimization