An Efficient Approach for VM and Database Segmentation of Cloud Resources Over Cloud Computing
Virtual machine (VM) clusters are used in cloud computing models to safeguard resources from failure and provide redundancy. Tasks for cloud users are planned by choosing appropriate resources to carry out the work within the virtual machine cluster. Issues with pre-configuration, downtime, complica...
Gespeichert in:
Veröffentlicht in: | SN computer science 2024-10, Vol.5 (8), p.977, Article 977 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Virtual machine (VM) clusters are used in cloud computing models to safeguard resources from failure and provide redundancy. Tasks for cloud users are planned by choosing appropriate resources to carry out the work within the virtual machine cluster. Issues with pre-configuration, downtime, complicated backup procedures, and disaster management plague the current VM clustering methods. High availability resources with dynamic and on-demand configuration are provided by virtual machine infrastructure. To improve efficiency and availability, the suggested technique supports the VM clustering process, which places and allocates virtual machines (VMs) based on the size of the requested task and the bandwidth level based on the migration, the suggested clustering procedure is divided into pre- and post-clustering stages. The task and bandwidth classification procedure groups jobs that can run in a virtual machine cluster with sufficient bandwidth. Depending on the VM’s availability inside the cluster, the bandwidth is mapped to the virtual machine. Several performance metrics, including bucket size, task execution time, VM lifetime, and VM utilization, are used in the VM clustering process. The suggested VM clustering’s primary goal is to map tasks to bandwidth-efficient virtual machines (VMs) in order to achieve high availability and dependability. As opposed to current algorithms, it shortens the time allotted for tasks and their execution. |
---|---|
ISSN: | 2661-8907 2662-995X 2661-8907 |
DOI: | 10.1007/s42979-024-03204-6 |