{"title":"An Enhanced Trust Scheduling Algorithm for Medical Applications in a Heterogeneous Cloud Computing Environment","authors":"Vedha Vinodha","doi":"10.17559/tv-20230913000935","DOIUrl":null,"url":null,"abstract":": This paper aims to present and deploy an improved task scheduling algorithm for the allocation of user tasks across multiple computing resources. The primary goal of this algorithm is to minimize both execution time and costs while simultaneously enhancing resource utilization within the context of medical applications. Virtual machine scheduling in a heterogeneous cloud environment needs significant attention with the increase in the usage of cloud resources by end users and enterprises. It is one of the significant parameters that affects cloud data centers. The resources requested by every user vary in their configuration. Finding a suitable virtual machine for each process is dynamically a time-consuming process. Virtual machines are classified based on resources such as memory and processing units. Upon the arrival of a request with specific requirements, it can be effortlessly mapped to a corresponding virtual machine. This process is followed by a bilateral method encompassing queuing and scheduling. Queues are formed for requests with different requirements, which are followed by a scheduling algorithm that allocates VMs based on the minimum remaining resources in the resource pool. A scheduling mechanism has been designed to solve the problem of starvation that occurs with the Min-Min fit scheduling policy. The average turnaround time and waiting times are observed to be significantly reduced, which has an impact on the performance of the data center for medical applications. Using the CloudSim Plus tool, the experimental outcomes demonstrated that the proposed approach exhibited remarkable superiority over competing methods in relation to metrics such as average waiting time, turnaround time, and response time. This advantage was observed when compared to multiple algorithms that were examined during the study.","PeriodicalId":510054,"journal":{"name":"Tehnicki vjesnik - Technical Gazette","volume":"85 16","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tehnicki vjesnik - Technical Gazette","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17559/tv-20230913000935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
: This paper aims to present and deploy an improved task scheduling algorithm for the allocation of user tasks across multiple computing resources. The primary goal of this algorithm is to minimize both execution time and costs while simultaneously enhancing resource utilization within the context of medical applications. Virtual machine scheduling in a heterogeneous cloud environment needs significant attention with the increase in the usage of cloud resources by end users and enterprises. It is one of the significant parameters that affects cloud data centers. The resources requested by every user vary in their configuration. Finding a suitable virtual machine for each process is dynamically a time-consuming process. Virtual machines are classified based on resources such as memory and processing units. Upon the arrival of a request with specific requirements, it can be effortlessly mapped to a corresponding virtual machine. This process is followed by a bilateral method encompassing queuing and scheduling. Queues are formed for requests with different requirements, which are followed by a scheduling algorithm that allocates VMs based on the minimum remaining resources in the resource pool. A scheduling mechanism has been designed to solve the problem of starvation that occurs with the Min-Min fit scheduling policy. The average turnaround time and waiting times are observed to be significantly reduced, which has an impact on the performance of the data center for medical applications. Using the CloudSim Plus tool, the experimental outcomes demonstrated that the proposed approach exhibited remarkable superiority over competing methods in relation to metrics such as average waiting time, turnaround time, and response time. This advantage was observed when compared to multiple algorithms that were examined during the study.
:本文旨在介绍和部署一种改进的任务调度算法,用于在多个计算资源之间分配用户任务。该算法的主要目标是最大限度地减少执行时间和成本,同时提高医疗应用中的资源利用率。随着终端用户和企业对云资源使用的增加,异构云环境中的虚拟机调度需要引起高度重视。它是影响云数据中心的重要参数之一。每个用户所需的资源配置各不相同。为每个进程寻找合适的虚拟机是一个动态的耗时过程。虚拟机根据内存和处理单元等资源进行分类。在收到具有特定要求的请求时,可以毫不费力地将其映射到相应的虚拟机上。这一过程之后是一个包括队列和调度的双边方法。为不同要求的请求建立队列,然后采用调度算法,根据资源池中的最小剩余资源分配虚拟机。设计了一种调度机制,以解决 Min-Min fit 调度策略中出现的饥饿问题。据观察,平均周转时间和等待时间明显缩短,这对医疗应用数据中心的性能产生了影响。通过使用 CloudSim Plus 工具,实验结果表明,在平均等待时间、周转时间和响应时间等指标方面,所提出的方法比其他竞争方法具有明显优势。与研究过程中考察的多种算法相比,这种优势更加明显。