Research Article

Uncertainty aware heuristic scheduling for resource constrained distributed data processing

Authors

  • Min-Chul Park * Department of Mechanical Design Engineering, Korea Advanced Institute of Engineering Design (KAIED), Daejeon, Republic of Korea.
  • Seo-Yeon Kim Department of Mechanical Design Engineering, Korea Advanced Institute of Engineering Design (KAIED), Daejeon, Republic of Korea.
  • Alessandro Conti Dipartimento di Meccanica, Politecnico di Milano, Milano, Italy.
  • Samar Q. Hassan Department of Industrial Engineering, Jordan University of Science and Technology, Irbid, Jordan.
  • Pieter J. De Wit Department of Mechanical Engineering, KU Leuven, Leuven, Belgium.

https://doi.org/10.48313/uda.v3i4.115

Abstract

Distributed task scheduling under variable durations requires distinguishing local risk-aware placement from a workflow-level deadline guarantee. We formulate a chance-constrained scheduling framework and examine reported results for CHARM, a restricted quantile-guided heuristic on 100 random layered Directed Acyclic Graphs (DAGs) of 30–60 tasks and an eight-worker heterogeneous cluster. Worker calibration traces inform per-task placement and a bounded local repair pass. At log-normal noise σ = 0.3, mean realized makespan is 9.80 time units versus 9.94 for a Heterogeneous Earliest Finish Time (HEFT) assignment evaluated under common dispatch semantics, a 1.4% reduction, with nominal makespan 8.07 versus 7.82. The fraction exceeding 1.1 times each method's own nominal makespan is 0.797 versus 0.891; this method-dependent threshold is a plan-relative measure rather than a common external deadline. Removing the local chance gate raises realized makespan by 0.13 and the plan-relative exceedance fraction by 0.029. Removing local repair leaves the displayed realized mean unchanged. The experiment does not certify the workflow chance constraint, evaluate runtime rescheduling, or test production traces. Reported statistical results and duration conventions require raw-outcome verification, including an inconsistency in the miss-probability signed-rank summary.    

Keywords

Task scheduling Uncertainty Chance constraints Heterogeneous computing Makespan robustness Heterogeneous earliest finish time
References (20)
  1. [1] Deelman, E., Vahi, K., Juve, G., Rynge, M., Callaghan, S., Maechling, P. J., … ., & Wenger, K. (2015). Pegasus, a workflow management system for science automation. Future generation computer systems, 46, 17–35. https://doi.org/10.1016/j.future.2014.10.008

  2. [2] Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., & Vahi, K. (2013). Characterizing and profiling scientific workflows. Future generation computer systems, 29(3), 682–692. https://doi.org/10.1016/j.future.2012.08.015

  3. [3] Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002). Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE transactions on parallel and distributed systems, 13(3), 260–274. https://doi.org/10.1109/71.993206

  4. [4] Reiss, C., Tumanov, A., Ganger, G. R., Katz, R. H., & Kozuch, M. A. (2012). Heterogeneity and dynamicity of clouds at scale: Google trace analysis. Proceedings of the third ACM symposium on cloud computing (pp. 1–13). Association for Computing Machinery. https://doi.org/10.1145/2391229.2391236

  5. [5] Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems. Springer. https://doi.org/10.1007/978-1-4614-2361-4

Article Metrics

How to Cite

Park, M.-C., Kim, S.-Y., Conti, A., Hassan, S. Q., & De Wit, P. J. (2026). Uncertainty aware heuristic scheduling for resource constrained distributed data processing. Uncertainty Discourse and Applications, 3(4), 272-284. https://doi.org/10.48313/uda.v3i4.115

Similar Articles

1-10 of 66

You may also start an advanced similarity search for this article.