IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v11y2019i5p109-d229097.html
   My bibliography  Save this article

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

Author

Listed:
  • Amer Al-Rahayfeh

    (Department of Computer Science, Al-Hussein Bin Talal University, Ma’an 71111, Jordan)

  • Saleh Atiewi

    (Department of Computer Science, Al-Hussein Bin Talal University, Ma’an 71111, Jordan)

  • Abdullah Abuhussein

    (Department of Information Systems, St. Cloud State University, St. Cloud, MN 56301, USA)

  • Muder Almiani

    (Department of Computer Information Systems, Al-Hussein Bin Talal University, Ma’an 71111, Jordan)

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.

Suggested Citation

  • Amer Al-Rahayfeh & Saleh Atiewi & Abdullah Abuhussein & Muder Almiani, 2019. "Novel Approach to Task Scheduling and Load Balancing Using the Dominant Sequence Clustering and Mean Shift Clustering Algorithms," Future Internet, MDPI, vol. 11(5), pages 1-15, May.
  • Handle: RePEc:gam:jftint:v:11:y:2019:i:5:p:109-:d:229097
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/11/5/109/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/11/5/109/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:11:y:2019:i:5:p:109-:d:229097. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.