Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
Performance-Aware Workflow Management for Grid Computing
The Computer Journal
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Task Scheduling in Grid Based on Particle Swarm Optimization
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Using Simulated Annealing for Task Scheduling in Distributed Systems
CSSIM '09 Proceedings of the 2009 International Conference on Computational Intelligence, Modelling and Simulation
A Tabu Search for the Heterogeneous DAG Scheduling Problem
ICPADS '09 Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special issue on the 2009 ACM/IEEE international symposium on networks-on-chip
Chemical-reaction-inspired metaheuristic for optimization
IEEE Transactions on Evolutionary Computation
Task Scheduling of Computational Grid Based on Particle Swarm Algorithm
CSO '10 Proceedings of the 2010 Third International Joint Conference on Computational Science and Optimization - Volume 02
Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fuzzy job-shop scheduling based on ranking level (λ, 1) interval-valued fuzzy numbers
IEEE Transactions on Fuzzy Systems
Chemical Reaction Optimization for Heterogeneous Computing Environments
ISPA '12 Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications
| Hi-index | 0.00 |
A new meta-heuristic method, called Chemical Reaction Optimization (CRO), has been proposed very recently. The method encodes solutions as molecules and mimics the interactions of molecules in chemical reactions to search the optimal solutions. The CRO method has demonstrated its capability in solving NP-hard optimization problems. In this paper, 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. There are two molecular structures in DMSCRO: one is used to encode the execution order of the tasks in a DAG job, and the other to encode the task-to-computing-node mapping. The DMSCRO method also designs four elementary chemical reaction operations and the fitness function suitable for the scenario of DAG scheduling. In this paper, we have also conducted the simulation experiments to verify the effectiveness and efficiency of DMSCRO over a large set of randomly generated graphs and the graphs for real-world problems.