Struct GangSchedulingPolicy 

pub struct GangSchedulingPolicy {
    pub min_count: i32,
}

GangSchedulingPolicy defines the parameters for gang scheduling.

Fields

min_count: i32

minCount is the minimum number of pods that must be schedulable or scheduled at the same time for the scheduler to admit the entire group. It must be a positive integer. This field is mutable to support workload scaling.

Note that the scheduler operates on an eventually consistent model. Updates to minCount may not be immediately reflected in scheduling decisions due to propagation delays. If minCount is updated while a scheduling cycle is in progress for that group, the new value may not take effect until the next cycle. Moreover, minCount is only enforced during scheduling, meaning that modifications to this field do not affect already-scheduled pods, applying only to those evaluated in future cycles.

Trait Implementations

impl Clone for GangSchedulingPolicy

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GangSchedulingPolicy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl DeepMerge for GangSchedulingPolicy

fn merge_from(&mut self, other: Self)

Merge other into self.

impl Default for GangSchedulingPolicy

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GangSchedulingPolicy

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GangSchedulingPolicy

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for GangSchedulingPolicy

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GangSchedulingPolicy