strategy

package

v0.1.1 Latest Latest Go to latest Published: Aug 27, 2026 License: MIT Imports: 8 Imported by: 2

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/projecteru2/core

Links

Open Source Insights

Documentation ¶

Index ¶

Constants
Variables
func AveragePlan(_ context.Context, infos []Info, need, _, limit int) (map[string]int, error)
func CommunismPlan(_ context.Context, infos []Info, need, total, limit int) (map[string]int, error)
func Deploy(ctx context.Context, strategy string, count, nodesLimit int, ...) (map[string]int, error)
func DrainedPlan(_ context.Context, infos []Info, need, total, _ int) (map[string]int, error)
func FillPlan(_ context.Context, infos []Info, need, _, limit int) (_ map[string]int, err error)
func GlobalPlan(_ context.Context, infos []Info, need, total, _ int) (map[string]int, error)
type Info

Constants ¶

View Source

const (
	Auto    = "AUTO"
	Fill    = "FILL"
	Each    = "EACH"
	Global  = "GLOBAL"
	Drained = "DRAINED"
	// Dummy marks a capacity-only request and has no entry in Plans
	Dummy = "DUMMY"
)

Variables ¶

View Source

var Plans = map[string]strategyFunc{
	Auto:    CommunismPlan,
	Fill:    FillPlan,
	Each:    AveragePlan,
	Global:  GlobalPlan,
	Drained: DrainedPlan,
}

Functions ¶

func AveragePlan ¶

func AveragePlan(_ context.Context, infos []Info, need, _, limit int) (map[string]int, error)

AveragePlan puts need workloads on each of limit nodes; need is per node, limit 0 means every node.

func CommunismPlan ¶

func CommunismPlan(_ context.Context, infos []Info, need, total, limit int) (map[string]int, error)

CommunismPlan spreads need workloads so the global per-node count ends as even as possible.

func Deploy ¶

func Deploy(ctx context.Context, strategy string, count, nodesLimit int, strategyInfos []Info, total int) (map[string]int, error)

func DrainedPlan ¶

func DrainedPlan(_ context.Context, infos []Info, need, total, _ int) (map[string]int, error)

DrainedPlan fills the lowest-capacity nodes first, draining each before moving to the next.

func FillPlan ¶

func FillPlan(_ context.Context, infos []Info, need, _, limit int) (_ map[string]int, err error)

FillPlan tops every node up to need workloads; need is a per-node ceiling, limit 0 means every node.

func GlobalPlan ¶

func GlobalPlan(_ context.Context, infos []Info, need, total, _ int) (map[string]int, error)

GlobalPlan spreads need workloads to keep Usage+Rate as even as possible across nodes.

Types ¶

type Info ¶

type Info struct {
	Nodename string

	Usage float64
	Rate  float64

	Capacity int
	Count    int
}

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL