You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@yunikorn.apache.org by "Manikandan R (Jira)" <ji...@apache.org> on 2026/03/24 09:25:00 UTC
[jira] [Resolved] (YUNIKORN-3233) Improve victim selection algorithm
[ https://issues.apache.org/jira/browse/YUNIKORN-3233?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Manikandan R resolved YUNIKORN-3233.
------------------------------------
Fix Version/s: 1.9.0
Resolution: Fixed
> Improve victim selection algorithm
> ----------------------------------
>
> Key: YUNIKORN-3233
> URL: https://issues.apache.org/jira/browse/YUNIKORN-3233
> Project: Apache YuniKorn
> Issue Type: Sub-task
> Components: core - scheduler
> Reporter: Manikandan R
> Assignee: Manikandan R
> Priority: Major
> Labels: pull-request-available
> Fix For: 1.9.0
>
>
> After collecting the victims, traversal starts to pick each victim and add to the final list until we meet the preemptable resource requirements. Sum of the resources used by victims collected so far might fall below or exceed above the preemptable required resources. It is very unlikely that both are same and equals. To avoid “exceed above” cases, there could be a chance that victims waiting next in the list might be good match when compared to the ones processed earlier.
> How do we pick more appropriate victims to match the expected preemptable resources on “best fit” (resource wise) basis precisely to avoid freeing up resources unnecessarily?
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@yunikorn.apache.org
For additional commands, e-mail: dev-help@yunikorn.apache.org