Next Article in Journal
A Yielding Protocol that Uses Inter-Vehicle Communication to Improve the Traffic of Vehicles on a Low-Priority Road at an Unsignalized Intersection
Previous Article in Journal
A Lightweight Elliptic-Elgamal-Based Authentication Scheme for Secure Device-to-Device Communication
Previous Article in Special Issue
Simulating Fog and Edge Computing Scenarios: An Overview and Research Challenges
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

Novel Approach to Task Scheduling and Load Balancing Using the Dominant Sequence Clustering and Mean Shift Clustering Algorithms

1
Department of Computer Science, Al-Hussein Bin Talal University, Ma’an 71111, Jordan
2
Department of Information Systems, St. Cloud State University, St. Cloud, MN 56301, USA
3
Department of Computer Information Systems, Al-Hussein Bin Talal University, Ma’an 71111, Jordan
*
Author to whom correspondence should be addressed.
Future Internet 2019, 11(5), 109; https://doi.org/10.3390/fi11050109
Received: 21 February 2019 / Revised: 27 March 2019 / Accepted: 3 May 2019 / Published: 8 May 2019
(This article belongs to the Special Issue Cloud Computing and Internet of Things)
  |  
PDF [1988 KB, uploaded 8 May 2019]
  |     |  

Abstract

Cloud computing (CC) is fast-growing and frequently adopted in information technology (IT) environments due to the benefits it offers. Task scheduling and load balancing are amongst the hot topics in the realm of CC. To overcome the shortcomings of the existing task scheduling and load balancing approaches, we propose a novel approach that uses dominant sequence clustering (DSC) for task scheduling and a weighted least connection (WLC) algorithm for load balancing. First, users’ tasks are clustered using the DSC algorithm, which represents user tasks as graph of one or more clusters. After task clustering, each task is ranked using Modified Heterogeneous Earliest Finish Time (MHEFT) algorithm. where the highest priority task is scheduled first. Afterwards, virtual machines (VM) are clustered using a mean shift clustering (MSC) algorithm using kernel functions. Load balancing is subsequently performed using a WLC algorithm, which distributes the load based on server weight and capacity as well as client connectivity to server. A highly weighted or least connected server is selected for task allocation, which in turn increases the response time. Finally, we evaluate the proposed architecture using metrics such as response time, makespan, resource utilization, and service reliability. View Full-Text
Keywords: cloud computing; task scheduling; DSC algorithm; ranking; MHEFT algorithm; VMs; MSC algorithm; load balancing; WLC algorithm cloud computing; task scheduling; DSC algorithm; ranking; MHEFT algorithm; VMs; MSC algorithm; load balancing; WLC algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Al-Rahayfeh, A.; Atiewi, S.; Abuhussein, A.; Almiani, M. Novel Approach to Task Scheduling and Load Balancing Using the Dominant Sequence Clustering and Mean Shift Clustering Algorithms. Future Internet 2019, 11, 109.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top