Journal ArticleDOI
A DAG scheduling scheme on heterogeneous computing systems using double molecular structure-based chemical reaction optimization
Reads0
Chats0
TLDR
The CRO scheme is used to formulate the scheduling of Directed Acyclic Graph (DAG) jobs in heterogeneous computing systems, and a Double Molecular Structure-based Chemical Reaction Optimization (DMSCRO) method is developed.About:
This article is published in Journal of Parallel and Distributed Computing.The article was published on 2013-09-01. It has received 97 citations till now. The article focuses on the topics: Optimization problem & Job shop scheduling.read more
Citations
More filters
Journal ArticleDOI
An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: Formal verification, simulation, and statistical testing
TL;DR: The proposed algorithm uses the advantages of evolutionary genetic algorithm along with heuristic approaches and outperformed the makespans of the three well-known heuristic algorithms and also the execution time of the recently meta-heuristics algorithm.
Journal ArticleDOI
A Hybrid Chemical Reaction Optimization Scheme for Task Scheduling on Heterogeneous Computing Systems
TL;DR: An improved hybrid version of the CRO method called HCRO (hybrid CRO) is developed for solving the DAG-based task scheduling problem, and a new selection strategy is proposed that reduces the chance of cloning before new molecules are generated.
Journal ArticleDOI
Bi-objective workflow scheduling of the energy consumption and reliability in heterogeneous computing systems
TL;DR: A novel bi-objective genetic algorithm (BOGA) to pursue low energy consumption and high system reliability for workflow scheduling and performs significantly better in terms of finding the spread of compromise solutions.
Journal ArticleDOI
Load Balancing in Cloud Computing Environment Using Improved Weighted Round Robin Algorithm for Nonpreemptive Dependent Tasks
TL;DR: Object of this work is to introduce and evaluate the proposed scheduling and load balancing algorithm by considering the capabilities of each virtual machine (VM), the task length of each requested job, and the interdependency of multiple tasks.
Journal ArticleDOI
Multi-objective backtracking search algorithm for economic emission dispatch problem
TL;DR: The multi-objective BSA developed and presented in this paper uses an elitist external archive to store non-dominated solutions known as pareto front and is able to solve EED problems efficiently.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
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.