Coalition theory based task scheduling algorithm using DLFC‐NN model

• Published in: Concurrency and computation 2024-05, Vol.36 (10)
• Main Authors: Mishra, Ashis Kumar, Mohapatra, Subasish, Sahu, Pradip Kumar
• Format: Article
• Language: English
• Subjects: Algorithms; Cloud computing; Clustering; Graph theory; Optimization; Resource management; Resource scheduling; Scheduling; Task scheduling
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.8005

Resource management and job scheduling are essential in today's cloud computing world. Due to task scheduling and users' diverse submission of large‐scale requests, co‐located VM instances negatively impacted the performance of leased VM instances. This workload further led to resource rivalry across co‐located VMs. In order to address the aforementioned problems, numerous strategies have been presented, however, they fail to take the asynchronous nature of the cloud environment into account. To address this issue, a novel “CTA using DLFC‐NN model” is proposed. This proposed approach combines the coalition theory and DLFC‐NN techniques by including IRT‐OPTICS for task size clustering, digital metrology based on ionized information (DMBII) for defect detection in virtue machines (VM), and the dynamic levy flight hamster optimization algorithm for processing time optimization of the clusters. However, the implementation of task scheduling in an online environment is limited by a number of presumptions or oversimplifications made by current scheduling systems. As a result, a unique coalition theory is applied to efficiently schedule activities. In addition, the DLFC‐NN model is used to reduce resource consumption, span time, and be highly accurate and energy‐efficient when working on both online and offline jobs. Nevertheless, while optimizing the clusters' overall execution time, earlier approaches only decreased the make‐span time for task scheduling. However, the DLFC‐NN model solves the computation problem by using a fully weighted bipartite graph and the pseudo method to determine the fitness of the least makespan time. The enhanced methodology used in this study reduces the scheduling cost and minimizes job completion times according to different task counts when compared to the existing techniques.