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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Future internet Ročník 11; číslo 5; s. 109
Hlavní autoři: Al-Rahayfeh, Amer, Atiewi, Saleh, Abuhussein, Abdullah, Almiani, Muder
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.05.2019
Témata:
Algorithms
Bandwidths
Cloud computing
Clustering
Computer centers
DSC algorithm
Energy consumption
Information technology
Internet
Kernel functions
Load
Load balancing
Methods
MHEFT algorithm
Motivation
MSC algorithm
Optimization algorithms
ranking
Resource utilization
Response time
Schedules
Scheduling
Servers
Task scheduling
Virtual environments
VMs
WLC algorithm
ISSN:1999-5903, 1999-5903
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-5903
1999-5903
DOI:10.3390/fi11050109