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.
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