Scheduling jobs on computational grid using differential evolution algorithm
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Budget-Deadline constrained workflow planning for admission control in market-oriented environments
GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
Concurrency and Computation: Practice & Experience
Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds
Future Generation Computer Systems
Cost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Meta-schedulers for grid computing based on multi-objective swarm algorithms
Applied Soft Computing
Budget-Deadline Constrained Workflow Planning for Admission Control
Journal of Grid Computing
Multi-objective list scheduling of workflow applications in distributed computing infrastructures
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (e.g. execution cost and time, which may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics rather than a deterministic algorithm. In this paper, we have proposed a workflow execution planning approach using Multiobjective Differential Evolution (MODE). Our goal was to generate a set of trade-off schedules according to two user specified QoS requirements (time and cost), which will offer more flexibility to users when estimating their QoS requirements. We have compared our results with a well-known baseline algorithm ‘Pareto-archived Evolutionary Strategy (PAES)’. Simulation results show that the modified MODE is able to find significantly better spread of compromise solutions compared with that of PAES. Copyright © 2009 John Wiley & Sons, Ltd.