Documentation
¶
Index ¶
- func NewFilterPods(pods []*v1.Pod, CapicityCoreAndMen float64) fiterPods
- func ScheduleNode(pods []*v1.Pod, host *v1.Node) []int
- type NodeInfo
- func (node *NodeInfo) FindChildren(pods fiterPods) []*NodeInfo
- func (node *NodeInfo) Search(pods fiterPods) int
- func (node *NodeInfo) SetBound(pods fiterPods)
- func (node *NodeInfo) SetIndexs(pods fiterPods)
- func (node *NodeInfo) SetPod(pods fiterPods)
- func (node *NodeInfo) SetProfit(pods fiterPods)
- func (node *NodeInfo) SetWeight(pods fiterPods)
- func (node *NodeInfo) ShowChoices() []*PodInfo
- type PodInfo
- type PriorityQueue
- type Weight
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func NewFilterPods ¶
Types ¶
type NodeInfo ¶
type NodeInfo struct { Parent *NodeInfo //b&b use Profit float64 Allocate Weight Bound float64 Capicity Weight //is pod should be choose and pod index in queue Pod *PodInfo Take bool Index int SearchJump int //heap index QIndex int }
func NewNodeInfo ¶
func (*NodeInfo) FindChildren ¶
func (*NodeInfo) ShowChoices ¶
type PodInfo ¶
type PodInfo struct { //generated id(unique) Id string //index in []v1.Pod Index int //pod request Weight //node usage Usage float64 }
func NewPodInfo ¶
func (*PodInfo) ComputeUsage ¶
type PriorityQueue ¶
type PriorityQueue []*NodeInfo
func (PriorityQueue) Len ¶
func (pq PriorityQueue) Len() int
func (PriorityQueue) Less ¶
func (pq PriorityQueue) Less(i, j int) bool
func (*PriorityQueue) Pop ¶
func (pq *PriorityQueue) Pop() interface{}
func (*PriorityQueue) Push ¶
func (pq *PriorityQueue) Push(x interface{})
func (PriorityQueue) Swap ¶
func (pq PriorityQueue) Swap(i, j int)
Click to show internal directories.
Click to hide internal directories.