Review on improved heuristic scheduling in the cloud based on a trust model for client-side data security and data integrity

• Main Author: Deshkar, Prarthana A.
• Format: Conference Proceeding
• Language: English
• Subjects: Cloud computing; Configuration management; Data integrity; Delivery scheduling; Heuristic; Heuristic methods; Heuristic scheduling; Parameters; Polynomials; Scheduling
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0240630

In recent years, “cloud computing” has evolved as a compelling paradigm for both the management and delivery of services through the internet. Heterogeneous Earliest Finish Time (HEFT) scheduling and trust value calculation are introduced in this study, along with a trust model and a suffrage heuristic. Parameters in the trust model are affected by the sub-parameters and the roles they play. These functions are regarded as a standard of durability and cannot be broken. The concept that better mappings might be formed by allocating a resource or machine that would suffer in terms of estimated time of completion if a given machine is not allocated will form the basis of a heuristic called suffrage. Due to its high performance and stability across a variety of graph configurations, the HEFT method is a viable solution for the Directed Acyclic Graph (DAG) and associated scheduling issue on the heterogeneous systems. Due to the vastness of the space at play, cloud computing scheduling falls into the family of problems known as Nondeterministic Polynomial (NP)-hard problems; in this context, it is preferable to discover a suboptimal solution in a short amount of time. Meta-heuristic methods are used to solve issues having approximate solutions. The effectiveness of meta-heuristics in tackling difficult, large-scale issues has led to its meteoric rise in popularity.