On Optimal Resource Allocation Algorithms for Paralellisable Jobs
Title
On Optimal Resource Allocation Algorithms for Paralellisable Jobs
Subject
Computer Science
Creator
Aadya Mudgil
Date
2024
Contributor
Arpan Mukhopadhyay
Abstract
Unprecedented demands are being placed on compute resources due to HPC jobs such as next-gen machine learning. Distributed systems rely on resource provisioning algorithms to parallelise these jobs across many nodes; however, traditional algorithms are unlikely to perform- an inefficient and costly waste of power and time. This research aims to design the optimal algorithm for parallelisable tasks, under a real-world workload, and validate theoretical expectations with the results from system simulations.
Files
Collection
Citation
Aadya Mudgil, “On Optimal Resource Allocation Algorithms for Paralellisable Jobs,” URSS SHOWCASE, accessed November 2, 2024, https://urss.warwick.ac.uk/items/show/699.