.png){kind=icon}
.png){kind=icon}
Return
Enhancing priority-based adaptive resource allocation for high-performance computing platforms
.png){kind=icon}
PRE
AI
DOI：10.1504/IJWGS.2026.151890.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
High-performance computing platforms accelerate rendering application execution by efficiently distributing workloads across clusters of computing hosts. Priority-based scheduling offers a simple and effective mechanism for computing resource allocation, often aligned with pay-per-use models. Traditional priority calculation methods often overlook inter-user parameters, such as competing user priorities and system scales. This paper presents an enhanced adaptive resource allocation strategy that introduces two normalisation techniques: priority scaling and weight sharing. By balancing fairness and responsiveness, the proposed method allows short jobs to complete earlier and avoids queue congestion, resulting in a more efficient and user-friendly environment for rendering workloads with diverse job types and priority levels. Experimental results show that this adaptive approach significantly reduces waiting times with marginal impact on the completion time of high-priority tasks.
Keywords:
cloud computing
priority-based scheduling
render farm
resource allocation
Journal
I
IF:
1.4
Papers:
5
Citations:
441