COMPARATIVE ANALYSIS OF WORKFLOW SCHEDULING ALGORITHMS IN CLOUD COMPUTING

Authors

  • Adlyn Prethesh Nazareth, Elistan Barreto

DOI:

https://doi.org/10.25215/8194288770.29

Abstract

This research presents a comparative analysis of six workflow scheduling heuristics—DATA, FCFS, MAXMIN, MCT, MINMIN, and ROUNDROBIN—using two scientific workflows, CyberShake_30 and Montage_50, simulated on WorkflowSim 1.0 built atop CloudSim. The experimental setup includes a heterogeneous environment with a single x86/Linux/Xen datacenter and a five-VM pool. A fixed pricing model is adopted, where CPU usage costs 0.3 per second and data transfer costs 0.2 per byte. Performance is evaluated based on makespan, total cost, average execution time, and total execution time. Results indicate that MAXMIN achieves the best performance for CyberShake_30, minimizing both makespan and cost, while MINMIN performs better for Montage_50, confirming that MAXMIN suits long-tail, CPU-intensive workflows whereas MINMIN favors balanced, fine-grained workflows.

Published

2026-03-11