Min-Time TS: task resource mapping algorithm in cloud computing

Author:

Kamalam G K,Kalaiyarasi T,Monaa S V,Gurudharshini B

Abstract

Abstract Internet-established cloud environment provides enormous amount of ubiquitous, distributed resources such as processors, memory, and software. In recent years, task scheduling and resource allocation has become a significant issue in cloud computing. Task scheduling plays a crucial role in cloud system performance. For achieving elegant performance, arises a need of efficient scheduling technique. Numerous algorithms developed for scheduling. In this paper, we have proposed an efficient approach which schedules the tasks to the available cloud resources by forming a task pair. Min-Time TS algorithm forms a finite number of task sets; each set consists a pair of tasks one from Group G1 and another from Group G2 and are scheduled with minimum layover time.

Publisher

IOP Publishing

Subject

General Medicine

Reference17 articles.

1. Hungarian method based joint transmission mode and relay selection in device-to-device communication;Chithra,2015

2. ScHeduling of jobs and Adaptive Resource Provisioning (SHARP) approach in cloud computing;Dinesh;Cluster Computing, Springer,2018

3. Content-Based Federated Job Scheduling Algorithm in Cloud Computing;Dinesh;Australian Journal of Basic and Applied Sciences,2016

4. On Kuhn’s Hungarian method - a tribute from Hungary;Frank;Naval Res. Logist.,2005

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3