Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type AssetFairness ¶
type AssetFairness struct {
// contains filtered or unexported fields
}
func NewAssetFairness ¶
func NewAssetFairness(resourceScarcity map[string]float64) (*AssetFairness, error)
func (*AssetFairness) CostFromAllocationAndWeight ¶
func (f *AssetFairness) CostFromAllocationAndWeight(allocation schedulerobjects.ResourceList, weight float64) float64
func (*AssetFairness) CostFromQueue ¶
func (f *AssetFairness) CostFromQueue(queue Queue) float64
type DominantResourceFairness ¶
type DominantResourceFairness struct {
// contains filtered or unexported fields
}
func NewDominantResourceFairness ¶
func NewDominantResourceFairness(totalResources schedulerobjects.ResourceList, resourcesToConsider []string) (*DominantResourceFairness, error)
func (*DominantResourceFairness) CostFromAllocationAndWeight ¶
func (f *DominantResourceFairness) CostFromAllocationAndWeight(allocation schedulerobjects.ResourceList, weight float64) float64
func (*DominantResourceFairness) CostFromQueue ¶
func (f *DominantResourceFairness) CostFromQueue(queue Queue) float64
type FairnessCostProvider ¶
type FairnessCostProvider interface {
CostFromQueue(queue Queue) float64
CostFromAllocationAndWeight(allocation schedulerobjects.ResourceList, weight float64) float64
}
FairnessCostProvider captures algorithms to compute the cost of an allocation.
type Queue ¶
type Queue interface {
// GetAllocation returns the current allocation of the queue.
GetAllocation() schedulerobjects.ResourceList
GetWeight() float64
}
Queue is a minimal representation of a queue used for computing fairness.
type QueueRepository ¶
type QueueRepository interface {
GetQueue(name string) (Queue, bool)
}
QueueRepository is a minimal representation of a queue repository used for computing fairness.
Click to show internal directories.
Click to hide internal directories.