Resource preprocessing and optimal task scheduling in cloud computing environments. (14th January 2014)

• Record Type: Journal Article
• Authors: Liu, Zhaobin; Qu, Wenyu; Liu, Weijiang; Li, Zhiyang; Xu, Yujie; Limet, Sébastien; Smari, Waleed W.; Spalazzi, Luca; Hu, Jia; Gao, Jianliang
• Is Part Of: Concurrency and computation. Volume 27:Number 13(2015:Sep.)
• Page Start: 3461
• Page End: 3482
• Publication Date: 2014-01-14
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3204
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main"> <title>Summary</title> <p>Cloud computing came into being and is currently an essential infrastructure of many commerce facilities. To achieve the promising potentials of cloud computing, effective and efficient scheduling algorithms are fundamentally important. However, conventional scheduling methodology encounters a number of challenges. During the tasks scheduling in cloud systems, how to make full use of resources and how to effectively select resources are also important factors. At the same time, communication delay also plays an important role in cloud scheduling, which not only leads to waiting between tasks but also results in much idle interval time between processing units. In this paper, a fuzzy clustering method is used to effectively preprocess the cloud resources. Combining the list scheduling with the task duplication scheduling scheme, a new directed acyclic graph based scheduling algorithm called earliest finish time duplication algorithm for heterogeneous cloud systems is presented. Earliest finish time duplication attempts to insert suitable immediate parent nodes of the current selected node in order to reduce its waiting time on the processor. The case study and experimental results illustrate that the algorithm proposed in this paper is better than the popular heterogeneous earliest finish time algorithms. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>