scispace - formally typeset
Open AccessJournal ArticleDOI

Multi-Objective Workflow Scheduling With Deep-Q-Network-Based Multi-Agent Reinforcement Learning

TLDR
A deep-Q-network model in a multi-agent reinforcement learning setting to guide the scheduling of multi-workflows over infrastructure-as-a-service clouds and experimental results suggest that the proposed approach outperforms traditional ones, e.g., non-dominated sorting genetic algorithm-II, multi-objective particle swarm optimization, and game-theoretic-based greedy algorithms, in terms of optimality of scheduling plans generated.
Abstract
Cloud Computing provides an effective platform for executing large-scale and complex workflow applications with a pay-as-you-go model. Nevertheless, various challenges, especially its optimal scheduling for multiple conflicting objectives, are yet to be addressed properly. The existing multi-objective workflow scheduling approaches are still limited in many ways, e.g., encoding is restricted by prior experts' knowledge when handling a dynamic real-time problem, which strongly influences the performance of scheduling. In this paper, we apply a deep-Q-network model in a multi-agent reinforcement learning setting to guide the scheduling of multi-workflows over infrastructure-as-a-service clouds. To optimize multi-workflow completion time and user's cost, we consider a Markov game model, which takes the number of workflow applications and heterogeneous virtual machines as state input and the maximum completion time and cost as rewards. The game model is capable of seeking for correlated equilibrium between make-span and cost criteria without prior experts' knowledge and converges to the correlated equilibrium policy in a dynamic real-time environment. To validate our proposed approach, we conduct extensive case studies based on multiple well-known scientific workflow templates and Amazon EC2 cloud. The experimental results clearly suggest that our proposed approach outperforms traditional ones, e.g., non-dominated sorting genetic algorithm-II, multi-objective particle swarm optimization, and game-theoretic-based greedy algorithms, in terms of optimality of scheduling plans generated.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A novel two-dimensional ECG feature extraction and classification algorithm based on convolution neural network for human authentication

TL;DR: This paper presents a novel authentication system using an efficient feature detection algorithm and a convolutional neural network (CNN) based on ECG for human authentication that is highly usable in a real-time authentication system.
Journal ArticleDOI

Biobjective Task Scheduling for Distributed Green Data Centers

TL;DR: A multiobjective optimization method for DGDCs to maximize the profit of DGDC providers and minimize the average task loss possibility of all applications by jointly determining the split of tasks among multiple ISPs and task service rates of each GDC.
Journal ArticleDOI

A Multi-Objective Deep Reinforcement Learning Framework

TL;DR: In this article, a scalable multi-objective deep reinforcement learning (MODRL) framework based on deep Q-networks is proposed for solving increasingly complicated multiobjective problems.
Journal ArticleDOI

Task scheduling based on deep reinforcement learning in a cloud manufacturing environment

TL;DR: The experimental results show that RLTS can be effective to solve the task scheduling in a cloud manufacturing environment and the Deep‐Q‐Network, as a kind of deep reinforcement learning algorithms, is employed to consider the problem of complexity and high dimension.
Journal ArticleDOI

A Survey of Network Attacks on Cyber-Physical Systems

TL;DR: The types of network attacks in CPSs, the intrusion detection methods and the attack defense strategies are surveyed, and the future research directions of CPSs network security are presented.
References
More filters
Journal ArticleDOI

A fast and elitist multiobjective genetic algorithm: NSGA-II

TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Posted Content

Playing Atari with Deep Reinforcement Learning

TL;DR: This work presents the first deep learning model to successfully learn control policies directly from high-dimensional sensory input using reinforcement learning, which outperforms all previous approaches on six of the games and surpasses a human expert on three of them.
Journal ArticleDOI

Handling multiple objectives with particle swarm optimization

TL;DR: An approach in which Pareto dominance is incorporated into particle swarm optimization (PSO) in order to allow this heuristic to handle problems with several objective functions and indicates that the approach is highly competitive and that can be considered a viable alternative to solve multiobjective optimization problems.
Proceedings Article

Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments

TL;DR: In this article, an actor-critic method was used to learn multi-agent coordination policies in cooperative and competitive multi-player RL games, where agent populations are able to discover various physical and informational coordination strategies.
Proceedings ArticleDOI

Resource Management with Deep Reinforcement Learning

TL;DR: This work presents DeepRM, an example solution that translates the problem of packing tasks with multiple resource demands into a learning problem, and shows that it performs comparably to state-of-the-art heuristics, adapts to different conditions, converges quickly, and learns strategies that are sensible in hindsight.
Related Papers (5)