scispace - formally typeset
Open AccessJournal ArticleDOI

Bio-Inspired Workflow Scheduling on HPC Platforms

TLDR
The objective of the research work is to use bio-inspired bacteria foraging optimization algorithm (BFOA) along with other heuristics algorithms for better search of the scheduling solution space for multiple workflows and demonstrates that the hybrid approach (MinMin/Myopic with B FOA) outperforms other approaches.
Abstract
Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature and are specified by workflow graphs. The aim of the cloud meta-scheduler is to schedule the user application tasks (and the applications) so as to optimize the resource utilization and to execute the user applications in minimum amount of time. During the past decade, there have been several attempts to use bio-inspired scheduling algorithms to obtain an optimal or near optimal schedule in order to minimize the overall schedule length and to optimize the use of resources. However, as the number of tasks increases, the solution space comprising different tasks-resource mapping sequences increases exponentially. Hence, there is a need to devise mechanisms to improvise the search strategies of the bio-inspired scheduling algorithms for better scheduling solutions in lesser number of iterations/time. The objective of the research work in this paper is to use bio-inspired bacteria foraging optimization algorithm (BFOA) along with other heuristics algorithms for better search of the scheduling solution space for multiple workflows. The idea is to first find a schedule by the heuristic algorithms such as MaxMin, MinMin, and Myopic, and use these as initial solutions (along with other randomly generated solutions) in the search space to get better solutions using BFOA. The performance of our approach with the existing approaches is compared for quality of the scheduling solutions. The results demonstrate that our hybrid approach (MinMin/Myopic with BFOA) outperforms other approaches.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A Novel QACS Automatic Extraction Algorithm for Extracting Information in Blockchain-Based Systems

TL;DR: In this article , the authors proposed an improved and adaptive Cuckoo search method for blockchain data mining, where quantum operation is introduced into the original K-means algorithm for automatic extraction of coded information in blockchain communications.
Journal ArticleDOI

Prediction of IoT Traffic Using the Gated Recurrent Unit Neural Network- (GRU-NN-) Based Predictive Model

TL;DR: In this article, the problem of IoT traffic prediction has been investigated and the authors propose a method to utilize the bandwidth and channel capacity optimally to predict IoT traffic in the current era.
Journal ArticleDOI

Incremental Outlier Feature Clustering Algorithm in Blockchain Networks Based on Big Data Analysis

TL;DR: Wang et al. as mentioned in this paper proposed a novel incremental outlier based on big data analysis for communicating networks in a blockchain environment, which uses the kernel density estimation technique with Gaussian kernel function to estimate the incremental outliers.
Journal ArticleDOI

Evaluating the performance of load balancing algorithm for heterogeneous cloudlets using HDDB algorithm

TL;DR: A considerable improvement in performance of the hybrid load balancing method when compared to other existing algorithms is revealed.
References
More filters
Book

An introduction to the bootstrap

TL;DR: This article presents bootstrap methods for estimation, using simple arguments, with Minitab macros for implementing these methods, as well as some examples of how these methods could be used for estimation purposes.
Journal ArticleDOI

Performance-effective and low-complexity task scheduling for heterogeneous computing

TL;DR: Two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time are presented, called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm.
Journal ArticleDOI

Greedy Randomized Adaptive Search Procedures

TL;DR: This paper defines the various components comprising a GRASP and demonstrates, step by step, how to develop such heuristics for combinatorial optimization problems.
Journal ArticleDOI

A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems

TL;DR: It is shown that for the cases studied here, the relatively simple Min?min heuristic performs well in comparison to the other techniques, and one even basis for comparison and insights into circumstances where one technique will out-perform another.
Proceedings ArticleDOI

A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments

TL;DR: This paper presents a particle swarm optimization (PSO) based heuristic to schedule applications to cloud resources that takes into account both computation cost and data transmission cost, and shows that PSO can achieve as much as 3 times cost savings as compared to BRS.
Related Papers (5)