Cluster Workload Allocation: A Predictive Approach Leveraging Machine Learning Efficiency

Leszek Sliwko
9/22/2025
cs.LGcs.AIcs.DC

No confident code implementation found for this paper.

Abstract

This research investigates how Machine Learning (ML) algorithms can assist in workload allocation strategies by detecting tasks with node affinity operators (referred to as constraint operators), which constrain their execution to a limited number of nodes. Using real-world Google Cluster Data (GCD) workload traces and the AGOCS framework, the study extracts node attributes and task constraints, then analyses them to identify suitable node-task pairings. It focuses on tasks that can be executed on either a single node or fewer than a thousand out of 12.5k nodes in the analysed GCD cluster. Task constraint operators are compacted, pre-processed with one-hot encoding, and used as features in a training dataset. Various ML classifiers, including Artificial Neural Networks, K-Nearest Neighbours, Decision Trees, Naive Bayes, Ridge Regression, Adaptive Boosting, and Bagging, are fine-tuned and assessed for accuracy and F1-scores. The final ensemble voting classifier model achieved 98% accuracy and a 1.5-1.8% misclassification rate for tasks with a single suitable node.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sliwko2025cluster,
  title  = {Cluster Workload Allocation: A Predictive Approach Leveraging Machine Learning Efficiency},
  author = {Leszek Sliwko},
  year   = {2025},
  eprint = {2509.17695},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.17695v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.17695.svg)](https://codeofpaper.com/paper/2509.17695)

Discussion