A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach
Authors:
- 4 August 2022
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1956-1979
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- A combinatorial double auction resource allocation model in cloud computingInformation Sciences, 2016
- A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queuesInformation Sciences, 2014
- Cloudbus Toolkit for Market-Oriented Cloud Computing2009
- Optimal preemptive scheduling for general target functionsJournal of Computer and System Sciences, 2006
- Exact Algorithms for NP-Hard Problems: A Survey2003
- Performance-effective and low-complexity task scheduling for heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- Approximation Algorithms for NP-Hard ProblemsACM SIGACT News, 1997
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shopEuropean Journal of Operational Research, 1994
- Complexity of Scheduling Parallel Task SystemsSIAM Journal on Discrete Mathematics, 1989