Merged in classMapWattsCommandLine (pull request #10)
Adding classMapWatts as a command-line argument to make it possible to enable/disable watts to power class mapping Approved-by: Renan DelValle Approved-by: ajain13
This commit is contained in:
commit
bff0fd2b1e
28 changed files with 871 additions and 2229 deletions
|
@ -15,8 +15,8 @@ To Do:
|
||||||
* Log fix for declining offer -- different reason when insufficient resources as compared to when there are no
|
* Log fix for declining offer -- different reason when insufficient resources as compared to when there are no
|
||||||
longer any tasks to schedule.
|
longer any tasks to schedule.
|
||||||
* Have a centralised logFile that can be filtered by identifier. All electron logs should go into this file.
|
* Have a centralised logFile that can be filtered by identifier. All electron logs should go into this file.
|
||||||
* Make ClassMapWatts to commandLine arguments so Electron can be run with ClassMapWatts enabled/disabled.
|
* Make def.Task an interface for further modularization and flexibility.
|
||||||
|
* Convert def#WattsToConsider(...) to be a receiver of def.Task and change the name of it to Watts(...).
|
||||||
|
|
||||||
**Requires [Performance Co-Pilot](http://pcp.io/) tool pmdumptext to be installed on the
|
**Requires [Performance Co-Pilot](http://pcp.io/) tool pmdumptext to be installed on the
|
||||||
machine on which electron is launched for logging to work and PCP collector agents installed
|
machine on which electron is launched for logging to work and PCP collector agents installed
|
||||||
|
|
|
@ -1,12 +1,8 @@
|
||||||
/*
|
/*
|
||||||
Constants that are used across scripts
|
Constants that are used across scripts
|
||||||
1. The available hosts = stratos-00x (x varies from 1 to 8)
|
1. The available hosts = stratos-00x (x varies from 1 to 8)
|
||||||
2. cap_margin = percentage of the requested power to allocate
|
2. Tolerance = tolerance for a task that when exceeded would starve the task.
|
||||||
3. power_threshold = overloading factor
|
3. ConsiderationWindowSize = number of tasks to consider for computation of the dynamic cap.
|
||||||
5. window_size = number of tasks to consider for computation of the dynamic cap.
|
|
||||||
|
|
||||||
Also, exposing functions to update or initialize some of the constants.
|
|
||||||
|
|
||||||
TODO: Clean this up and use Mesos Attributes instead.
|
TODO: Clean this up and use Mesos Attributes instead.
|
||||||
*/
|
*/
|
||||||
package constants
|
package constants
|
||||||
|
@ -16,17 +12,21 @@ var Hosts = []string{"stratos-001.cs.binghamton.edu", "stratos-002.cs.binghamton
|
||||||
"stratos-005.cs.binghamton.edu", "stratos-006.cs.binghamton.edu",
|
"stratos-005.cs.binghamton.edu", "stratos-006.cs.binghamton.edu",
|
||||||
"stratos-007.cs.binghamton.edu", "stratos-008.cs.binghamton.edu"}
|
"stratos-007.cs.binghamton.edu", "stratos-008.cs.binghamton.edu"}
|
||||||
|
|
||||||
// Classification of the nodes in the cluster based on their power consumption.
|
/*
|
||||||
|
Classification of the nodes in the cluster based on their Thermal Design Power (TDP).
|
||||||
|
The power classes are labelled in the decreasing order of the corresponding TDP, with class A nodes
|
||||||
|
having the highest TDP and class C nodes having the lowest TDP.
|
||||||
|
*/
|
||||||
var PowerClasses = map[string]map[string]bool{
|
var PowerClasses = map[string]map[string]bool{
|
||||||
"ClassA": map[string]bool{
|
"A": map[string]bool{
|
||||||
"stratos-005.cs.binghamton.edu": true,
|
"stratos-005.cs.binghamton.edu": true,
|
||||||
"stratos-006.cs.binghamton.edu": true,
|
"stratos-006.cs.binghamton.edu": true,
|
||||||
},
|
},
|
||||||
"ClassB": map[string]bool{
|
"B": map[string]bool{
|
||||||
"stratos-007.cs.binghamton.edu": true,
|
"stratos-007.cs.binghamton.edu": true,
|
||||||
"stratos-008.cs.binghamton.edu": true,
|
"stratos-008.cs.binghamton.edu": true,
|
||||||
},
|
},
|
||||||
"ClassC": map[string]bool{
|
"C": map[string]bool{
|
||||||
"stratos-001.cs.binghamton.edu": true,
|
"stratos-001.cs.binghamton.edu": true,
|
||||||
"stratos-002.cs.binghamton.edu": true,
|
"stratos-002.cs.binghamton.edu": true,
|
||||||
"stratos-003.cs.binghamton.edu": true,
|
"stratos-003.cs.binghamton.edu": true,
|
||||||
|
@ -34,69 +34,12 @@ var PowerClasses = map[string]map[string]bool{
|
||||||
},
|
},
|
||||||
}
|
}
|
||||||
|
|
||||||
// Add a new host to the slice of hosts.
|
|
||||||
func AddNewHost(newHost string) bool {
|
|
||||||
// Validation
|
|
||||||
if newHost == "" {
|
|
||||||
return false
|
|
||||||
} else {
|
|
||||||
Hosts = append(Hosts, newHost)
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
Lower bound of the percentage of requested power, that can be allocated to a task.
|
|
||||||
|
|
||||||
Note: This constant is not used for the proactive cluster wide capping schemes.
|
|
||||||
*/
|
|
||||||
var PowerThreshold = 0.6 // Right now saying that a task will never be given lesser than 60% of the power it requested.
|
|
||||||
|
|
||||||
/*
|
/*
|
||||||
Margin with respect to the required power for a job.
|
Margin with respect to the required power for a job.
|
||||||
So, if power required = 10W, the node would be capped to 75%*10W.
|
So, if power required = 10W, the node would be capped to Tolerance * 10W.
|
||||||
This value can be changed upon convenience.
|
This value can be changed upon convenience.
|
||||||
*/
|
*/
|
||||||
var CapMargin = 0.70
|
var Tolerance = 0.70
|
||||||
|
|
||||||
// Modify the cap margin.
|
|
||||||
func UpdateCapMargin(newCapMargin float64) bool {
|
|
||||||
// Checking if the new_cap_margin is less than the power threshold.
|
|
||||||
if newCapMargin < StarvationFactor {
|
|
||||||
return false
|
|
||||||
} else {
|
|
||||||
CapMargin = newCapMargin
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
The factor, that when multiplied with (task.Watts * CapMargin) results in (task.Watts * PowerThreshold).
|
|
||||||
This is used to check whether available power, for a host in an offer, is not less than (PowerThreshold * task.Watts),
|
|
||||||
which is assumed to result in starvation of the task.
|
|
||||||
Here is an example,
|
|
||||||
Suppose a task requires 100W of power. Assuming CapMargin = 0.75 and PowerThreshold = 0.6.
|
|
||||||
So, the assumed allocated watts is 75W.
|
|
||||||
Now, when we get an offer, we need to check whether the available power, for the host in that offer, is
|
|
||||||
not less than 60% (the PowerTreshold) of the requested power (100W).
|
|
||||||
To put it in other words,
|
|
||||||
availablePower >= 100W * 0.75 * X
|
|
||||||
where X is the StarvationFactor (80% in this case)
|
|
||||||
|
|
||||||
Note: This constant is not used for the proactive cluster wide capping schemes.
|
|
||||||
*/
|
|
||||||
var StarvationFactor = PowerThreshold / CapMargin
|
|
||||||
|
|
||||||
// Window size for running average
|
// Window size for running average
|
||||||
var ConsiderationWindowSize = 20
|
var ConsiderationWindowSize = 20
|
||||||
|
|
||||||
// Update the window size.
|
|
||||||
func UpdateWindowSize(newWindowSize int) bool {
|
|
||||||
// Validation
|
|
||||||
if newWindowSize == 0 {
|
|
||||||
return false
|
|
||||||
} else {
|
|
||||||
ConsiderationWindowSize = newWindowSize
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
45
def/task.go
45
def/task.go
|
@ -2,7 +2,9 @@ package def
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"bitbucket.org/sunybingcloud/electron/constants"
|
"bitbucket.org/sunybingcloud/electron/constants"
|
||||||
|
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
|
mesos "github.com/mesos/mesos-go/mesosproto"
|
||||||
"github.com/pkg/errors"
|
"github.com/pkg/errors"
|
||||||
"os"
|
"os"
|
||||||
)
|
)
|
||||||
|
@ -65,6 +67,34 @@ func (tsk *Task) SetTaskID(taskID string) bool {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
Determine the watts value to consider for each task.
|
||||||
|
|
||||||
|
This value could either be task.Watts or task.ClassToWatts[<power class>]
|
||||||
|
If task.ClassToWatts is not present, then return task.Watts (this would be for workloads which don't have classMapWatts)
|
||||||
|
*/
|
||||||
|
func WattsToConsider(task Task, classMapWatts bool, offer *mesos.Offer) (float64, error) {
|
||||||
|
if classMapWatts {
|
||||||
|
// checking if ClassToWatts was present in the workload.
|
||||||
|
if task.ClassToWatts != nil {
|
||||||
|
return task.ClassToWatts[offerUtils.PowerClass(offer)], nil
|
||||||
|
} else {
|
||||||
|
// Checking whether task.Watts is 0.0. If yes, then throwing an error.
|
||||||
|
if task.Watts == 0.0 {
|
||||||
|
return task.Watts, errors.New("Configuration error in task. Watts attribute is 0 for " + task.Name)
|
||||||
|
}
|
||||||
|
return task.Watts, nil
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
// Checking whether task.Watts is 0.0. If yes, then throwing an error.
|
||||||
|
if task.Watts == 0.0 {
|
||||||
|
return task.Watts, errors.New("Configuration error in task. Watts attribute is 0 for " + task.Name)
|
||||||
|
}
|
||||||
|
return task.Watts, nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sorter implements sort.Sort interface to sort tasks by Watts requirement.
|
||||||
type WattsSorter []Task
|
type WattsSorter []Task
|
||||||
|
|
||||||
func (slice WattsSorter) Len() int {
|
func (slice WattsSorter) Len() int {
|
||||||
|
@ -79,6 +109,21 @@ func (slice WattsSorter) Swap(i, j int) {
|
||||||
slice[i], slice[j] = slice[j], slice[i]
|
slice[i], slice[j] = slice[j], slice[i]
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Sorter implements sort.Sort interface to sort tasks by CPU requirement.
|
||||||
|
type CPUSorter []Task
|
||||||
|
|
||||||
|
func (slice CPUSorter) Len() int {
|
||||||
|
return len(slice)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (slice CPUSorter) Less(i, j int) bool {
|
||||||
|
return slice[i].CPU < slice[j].CPU
|
||||||
|
}
|
||||||
|
|
||||||
|
func (slice CPUSorter) Swap(i, j int) {
|
||||||
|
slice[i], slice[j] = slice[j], slice[i]
|
||||||
|
}
|
||||||
|
|
||||||
// Compare two tasks.
|
// Compare two tasks.
|
||||||
func Compare(task1 *Task, task2 *Task) bool {
|
func Compare(task1 *Task, task2 *Task) bool {
|
||||||
// If comparing the same pointers (checking the addresses).
|
// If comparing the same pointers (checking the addresses).
|
||||||
|
|
|
@ -2,6 +2,8 @@
|
||||||
Cluster wide dynamic capping
|
Cluster wide dynamic capping
|
||||||
|
|
||||||
This is a capping strategy that can be used with schedulers to improve the power consumption.
|
This is a capping strategy that can be used with schedulers to improve the power consumption.
|
||||||
|
|
||||||
|
Note: This capping strategy doesn't currently considered task.Watts to power class mapping with classMapWatts is enabled.
|
||||||
*/
|
*/
|
||||||
package powerCapping
|
package powerCapping
|
||||||
|
|
||||||
|
@ -21,7 +23,7 @@ type taskWrapper struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
func (tw taskWrapper) Val() float64 {
|
func (tw taskWrapper) Val() float64 {
|
||||||
return tw.task.Watts * constants.CapMargin
|
return tw.task.Watts * constants.Tolerance
|
||||||
}
|
}
|
||||||
|
|
||||||
func (tw taskWrapper) ID() string {
|
func (tw taskWrapper) ID() string {
|
||||||
|
@ -119,7 +121,7 @@ func (capper ClusterwideCapper) CleverRecap(totalPower map[string]float64,
|
||||||
// Not considering this task for the computation of totalAllocatedPower and totalRunningTasks
|
// Not considering this task for the computation of totalAllocatedPower and totalRunningTasks
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
wattsUsages[host] = append(wattsUsages[host], float64(task.Watts)*constants.CapMargin)
|
wattsUsages[host] = append(wattsUsages[host], float64(task.Watts)*constants.Tolerance)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -200,7 +202,7 @@ func (capper ClusterwideCapper) NaiveRecap(totalPower map[string]float64,
|
||||||
// Not considering this task for the computation of totalAllocatedPower and totalRunningTasks
|
// Not considering this task for the computation of totalAllocatedPower and totalRunningTasks
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
totalAllocatedPower += (float64(task.Watts) * constants.CapMargin)
|
totalAllocatedPower += (float64(task.Watts) * constants.Tolerance)
|
||||||
totalRunningTasks++
|
totalRunningTasks++
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -244,8 +246,7 @@ func (capper ClusterwideCapper) TaskFinished(taskID string) {
|
||||||
}
|
}
|
||||||
|
|
||||||
// First come first serve scheduling.
|
// First come first serve scheduling.
|
||||||
func (capper ClusterwideCapper) FCFSDeterminedCap(totalPower map[string]float64,
|
func (capper ClusterwideCapper) FCFSDeterminedCap(totalPower map[string]float64, newTask *def.Task) (float64, error) {
|
||||||
newTask *def.Task) (float64, error) {
|
|
||||||
// Validation
|
// Validation
|
||||||
if totalPower == nil {
|
if totalPower == nil {
|
||||||
return 100, errors.New("Invalid argument: totalPower")
|
return 100, errors.New("Invalid argument: totalPower")
|
||||||
|
|
12
scheduler.go
12
scheduler.go
|
@ -17,19 +17,21 @@ import (
|
||||||
|
|
||||||
var master = flag.String("master", "xavier:5050", "Location of leading Mesos master")
|
var master = flag.String("master", "xavier:5050", "Location of leading Mesos master")
|
||||||
var tasksFile = flag.String("workload", "", "JSON file containing task definitions")
|
var tasksFile = flag.String("workload", "", "JSON file containing task definitions")
|
||||||
var ignoreWatts = flag.Bool("ignoreWatts", false, "Ignore watts in offers")
|
var wattsAsAResource = flag.Bool("wattsAsAResource", false, "Enable Watts as a Resource")
|
||||||
var pcplogPrefix = flag.String("logPrefix", "", "Prefix for pcplog")
|
var pcplogPrefix = flag.String("logPrefix", "", "Prefix for pcplog")
|
||||||
var hiThreshold = flag.Float64("hiThreshold", 0.0, "Upperbound for when we should start capping")
|
var hiThreshold = flag.Float64("hiThreshold", 0.0, "Upperbound for when we should start capping")
|
||||||
var loThreshold = flag.Float64("loThreshold", 0.0, "Lowerbound for when we should start uncapping")
|
var loThreshold = flag.Float64("loThreshold", 0.0, "Lowerbound for when we should start uncapping")
|
||||||
|
var classMapWatts = flag.Bool("classMapWatts", false, "Enable mapping of watts to power class of node")
|
||||||
|
|
||||||
// Short hand args
|
// Short hand args
|
||||||
func init() {
|
func init() {
|
||||||
flag.StringVar(master, "m", "xavier:5050", "Location of leading Mesos master (shorthand)")
|
flag.StringVar(master, "m", "xavier:5050", "Location of leading Mesos master (shorthand)")
|
||||||
flag.StringVar(tasksFile, "w", "", "JSON file containing task definitions (shorthand)")
|
flag.StringVar(tasksFile, "w", "", "JSON file containing task definitions (shorthand)")
|
||||||
flag.BoolVar(ignoreWatts, "i", false, "Ignore watts in offers (shorthand)")
|
flag.BoolVar(wattsAsAResource, "waar", false, "Enable Watts as a Resource")
|
||||||
flag.StringVar(pcplogPrefix, "p", "", "Prefix for pcplog (shorthand)")
|
flag.StringVar(pcplogPrefix, "p", "", "Prefix for pcplog (shorthand)")
|
||||||
flag.Float64Var(hiThreshold, "ht", 700.0, "Upperbound for when we should start capping (shorthand)")
|
flag.Float64Var(hiThreshold, "ht", 700.0, "Upperbound for when we should start capping (shorthand)")
|
||||||
flag.Float64Var(loThreshold, "lt", 400.0, "Lowerbound for when we should start uncapping (shorthand)")
|
flag.Float64Var(loThreshold, "lt", 400.0, "Lowerbound for when we should start uncapping (shorthand)")
|
||||||
|
flag.BoolVar(classMapWatts, "cmw", false, "Enable mapping of watts to power class of node")
|
||||||
}
|
}
|
||||||
|
|
||||||
func main() {
|
func main() {
|
||||||
|
@ -58,7 +60,7 @@ func main() {
|
||||||
startTime := time.Now().Format("20060102150405")
|
startTime := time.Now().Format("20060102150405")
|
||||||
logPrefix := *pcplogPrefix + "_" + startTime
|
logPrefix := *pcplogPrefix + "_" + startTime
|
||||||
|
|
||||||
scheduler := schedulers.NewBinPackSortedWatts(tasks, *ignoreWatts, logPrefix)
|
scheduler := schedulers.NewBinPackedPistonCapper(tasks, *wattsAsAResource, logPrefix, *classMapWatts)
|
||||||
driver, err := sched.NewMesosSchedulerDriver(sched.DriverConfig{
|
driver, err := sched.NewMesosSchedulerDriver(sched.DriverConfig{
|
||||||
Master: *master,
|
Master: *master,
|
||||||
Framework: &mesos.FrameworkInfo{
|
Framework: &mesos.FrameworkInfo{
|
||||||
|
@ -72,8 +74,8 @@ func main() {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
//go pcp.Start(scheduler.PCPLog, &scheduler.RecordPCP, logPrefix)
|
go pcp.Start(scheduler.PCPLog, &scheduler.RecordPCP, logPrefix)
|
||||||
go pcp.StartPCPLogAndExtremaDynamicCap(scheduler.PCPLog, &scheduler.RecordPCP, logPrefix, *hiThreshold, *loThreshold)
|
//go pcp.StartPCPLogAndExtremaDynamicCap(scheduler.PCPLog, &scheduler.RecordPCP, logPrefix, *hiThreshold, *loThreshold)
|
||||||
time.Sleep(1 * time.Second) // Take a second between starting PCP log and continuing
|
time.Sleep(1 * time.Second) // Take a second between starting PCP log and continuing
|
||||||
|
|
||||||
// Attempt to handle signint to not leave pmdumptext running
|
// Attempt to handle signint to not leave pmdumptext running
|
||||||
|
|
|
@ -5,18 +5,16 @@ To Do:
|
||||||
|
|
||||||
* Design changes -- Possible to have one scheduler with different scheduling schemes?
|
* Design changes -- Possible to have one scheduler with different scheduling schemes?
|
||||||
* Fix the race condition on 'tasksRunning' in proactiveclusterwidecappingfcfs.go and proactiveclusterwidecappingranked.go
|
* Fix the race condition on 'tasksRunning' in proactiveclusterwidecappingfcfs.go and proactiveclusterwidecappingranked.go
|
||||||
* Separate the capping strategies from the scheduling algorithms and make it possible to use any capping strategy with any scheduler.
|
* **Critical**: Separate the capping strategies from the scheduling algorithms and make it possible to use any capping strategy with any scheduler.
|
||||||
* Make newTask(...) variadic where the newTaskClass argument can either be given or not. If not give, then pick task.Watts as the watts attribute, else pick task.ClassToWatts[newTaskClass].
|
|
||||||
* Retrofit pcp/proactiveclusterwidecappers.go to include the power capping go routines and to cap only when necessary.
|
|
||||||
* Create a package that would contain routines to perform various logging and move helpers.coLocated(...) into that.
|
* Create a package that would contain routines to perform various logging and move helpers.coLocated(...) into that.
|
||||||
* Retrofit schedulers to be able to run either using ClassMapWatts enabled or disabled.
|
* Move all the common struct members from all schedulers into base.go.
|
||||||
|
|
||||||
Scheduling Algorithms:
|
Scheduling Algorithms:
|
||||||
|
|
||||||
* First Fit
|
* First Fit
|
||||||
* First Fit with sorted watts
|
* First Fit with sorted watts
|
||||||
* Bin-packing with sorted watts
|
* Bin-packing with sorted watts
|
||||||
* ClassMapWatts -- Bin-packing and First Fit that now use Watts per power class.
|
* BinPacked-MaxMin -- Packing one large task with a bunch of small tasks.
|
||||||
* Top Heavy -- Hybrid scheduler that packs small tasks (less power intensive) using Bin-packing and spreads large tasks (power intensive) using First Fit.
|
* Top Heavy -- Hybrid scheduler that packs small tasks (less power intensive) using Bin-packing and spreads large tasks (power intensive) using First Fit.
|
||||||
* Bottom Heavy -- Hybrid scheduler that packs large tasks (power intensive) using Bin-packing and spreads small tasks (less power intensive) using First Fit.
|
* Bottom Heavy -- Hybrid scheduler that packs large tasks (power intensive) using Bin-packing and spreads small tasks (less power intensive) using First Fit.
|
||||||
|
|
||||||
|
|
|
@ -16,29 +16,31 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *BinPackSortedWattsSortedOffers) takeOffer(offer *mesos.Offer, totalCPU, totalRAM,
|
func (s *BinPackSortedWattsSortedOffers) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
totalWatts float64, task def.Task) bool {
|
|
||||||
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
// Does the task fit
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.Watts))) &&
|
if err != nil {
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
// Error in determining wattsConsideration
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if offerCPU >= task.CPU && offerRAM >= task.RAM && (!s.wattsAsAResource || (offerWatts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
type BinPackSortedWattsSortedOffers struct {
|
type BinPackSortedWattsSortedOffers struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -58,7 +60,8 @@ type BinPackSortedWattsSortedOffers struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBinPackSortedWattsSortedOffers(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BinPackSortedWattsSortedOffers {
|
func NewBinPackSortedWattsSortedOffers(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *BinPackSortedWattsSortedOffers {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -67,14 +70,15 @@ func NewBinPackSortedWattsSortedOffers(tasks []def.Task, ignoreWatts bool, sched
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BinPackSortedWattsSortedOffers{
|
s := &BinPackSortedWattsSortedOffers{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -102,8 +106,14 @@ func (s *BinPackSortedWattsSortedOffers) newTask(offer *mesos.Offer, task def.Ta
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -159,6 +169,11 @@ func (s *BinPackSortedWattsSortedOffers) ResourceOffers(driver sched.SchedulerDr
|
||||||
totalRAM := 0.0
|
totalRAM := 0.0
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
@ -167,10 +182,10 @@ func (s *BinPackSortedWattsSortedOffers) ResourceOffers(driver sched.SchedulerDr
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, task) {
|
if s.takeOffer(offer, task) {
|
||||||
|
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
totalWatts += task.Watts
|
totalWatts += wattsConsideration
|
||||||
totalCPU += task.CPU
|
totalCPU += task.CPU
|
||||||
totalRAM += task.RAM
|
totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
|
|
@ -26,17 +26,18 @@ import (
|
||||||
corresponding to the load on that node.
|
corresponding to the load on that node.
|
||||||
*/
|
*/
|
||||||
type BinPackedPistonCapper struct {
|
type BinPackedPistonCapper struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
taskMonitor map[string][]def.Task
|
taskMonitor map[string][]def.Task
|
||||||
totalPower map[string]float64
|
totalPower map[string]float64
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
ticker *time.Ticker
|
classMapWatts bool
|
||||||
isCapping bool
|
ticker *time.Ticker
|
||||||
|
isCapping bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule the new task.
|
// about to schedule the new task.
|
||||||
|
@ -57,7 +58,8 @@ type BinPackedPistonCapper struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler.
|
// New electron scheduler.
|
||||||
func NewBinPackedPistonCapper(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BinPackedPistonCapper {
|
func NewBinPackedPistonCapper(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *BinPackedPistonCapper {
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
@ -65,26 +67,32 @@ func NewBinPackedPistonCapper(tasks []def.Task, ignoreWatts bool, schedTracePref
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BinPackedPistonCapper{
|
s := &BinPackedPistonCapper{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
taskMonitor: make(map[string][]def.Task),
|
running: make(map[string]map[string]bool),
|
||||||
totalPower: make(map[string]float64),
|
taskMonitor: make(map[string][]def.Task),
|
||||||
RecordPCP: false,
|
totalPower: make(map[string]float64),
|
||||||
ticker: time.NewTicker(5 * time.Second),
|
RecordPCP: false,
|
||||||
isCapping: false,
|
ticker: time.NewTicker(5 * time.Second),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
isCapping: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
|
||||||
// check whether task fits the offer or not.
|
// check whether task fits the offer or not.
|
||||||
func (s *BinPackedPistonCapper) takeOffer(offerWatts float64, offerCPU float64, offerRAM float64,
|
func (s *BinPackedPistonCapper) takeOffer(offer *mesos.Offer, offerWatts float64, offerCPU float64, offerRAM float64,
|
||||||
totalWatts float64, totalCPU float64, totalRAM float64, task def.Task) bool {
|
totalWatts float64, totalCPU float64, totalRAM float64, task def.Task) bool {
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.Watts))) &&
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsToConsider
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if (!s.wattsAsAResource || (offerWatts >= (totalWatts + wattsConsideration))) &&
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
(offerCPU >= (totalCPU + task.CPU)) &&
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
(offerRAM >= (totalRAM + task.RAM)) {
|
||||||
return true
|
return true
|
||||||
|
@ -128,8 +136,14 @@ func (s *BinPackedPistonCapper) newTask(offer *mesos.Offer, task def.Task) *meso
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -182,7 +196,8 @@ func (s *BinPackedPistonCapper) startCapping() {
|
||||||
if err := rapl.Cap(host, "rapl", roundedCapValue); err != nil {
|
if err := rapl.Cap(host, "rapl", roundedCapValue); err != nil {
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
} else {
|
} else {
|
||||||
log.Printf("Capped [%s] at %d", host, int(math.Floor(capValue+0.5)))
|
log.Printf("Capped [%s] at %d", host,
|
||||||
|
int(math.Floor(capValue+0.5)))
|
||||||
}
|
}
|
||||||
bpPistonPreviousRoundedCapValues[host] = roundedCapValue
|
bpPistonPreviousRoundedCapValues[host] = roundedCapValue
|
||||||
}
|
}
|
||||||
|
@ -218,8 +233,8 @@ func (s *BinPackedPistonCapper) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
// retrieving the total power for each host in the offers
|
// retrieving the total power for each host in the offers
|
||||||
for _, offer := range offers {
|
for _, offer := range offers {
|
||||||
if _, ok := s.totalPower[*offer.Hostname]; !ok {
|
if _, ok := s.totalPower[*offer.Hostname]; !ok {
|
||||||
_, _, offer_watts := offerUtils.OfferAgg(offer)
|
_, _, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
s.totalPower[*offer.Hostname] = offer_watts
|
s.totalPower[*offer.Hostname] = offerWatts
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -257,12 +272,21 @@ func (s *BinPackedPistonCapper) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
partialLoad := 0.0
|
partialLoad := 0.0
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {continue}
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offerWatts, offerCPU, offerRAM, totalWatts, totalCPU, totalRAM, task) {
|
if s.takeOffer(offer, offerWatts, offerCPU, offerRAM,
|
||||||
|
totalWatts, totalCPU, totalRAM, task) {
|
||||||
|
|
||||||
// Start piston capping if haven't started yet
|
// Start piston capping if haven't started yet
|
||||||
if !s.isCapping {
|
if !s.isCapping {
|
||||||
|
@ -271,7 +295,7 @@ func (s *BinPackedPistonCapper) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
}
|
}
|
||||||
|
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
totalWatts += task.Watts
|
totalWatts += wattsConsideration
|
||||||
totalCPU += task.CPU
|
totalCPU += task.CPU
|
||||||
totalRAM += task.RAM
|
totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
@ -283,7 +307,7 @@ func (s *BinPackedPistonCapper) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
||||||
*task.Instances--
|
*task.Instances--
|
||||||
// updating the cap value for offer.Hostname
|
// updating the cap value for offer.Hostname
|
||||||
partialLoad += ((task.Watts * constants.CapMargin) / s.totalPower[*offer.Hostname]) * 100
|
partialLoad += ((wattsConsideration * constants.Tolerance) / s.totalPower[*offer.Hostname]) * 100
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
if *task.Instances <= 0 {
|
||||||
// All instances of task have been scheduled. Remove it
|
// All instances of task have been scheduled. Remove it
|
||||||
|
@ -364,9 +388,16 @@ func (s *BinPackedPistonCapper) StatusUpdate(driver sched.SchedulerDriver, statu
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Need to determine the watts consideration for the finishedTask
|
||||||
|
var wattsConsideration float64
|
||||||
|
if s.classMapWatts {
|
||||||
|
wattsConsideration = finishedTask.ClassToWatts[hostToPowerClass(hostOfFinishedTask)]
|
||||||
|
} else {
|
||||||
|
wattsConsideration = finishedTask.Watts
|
||||||
|
}
|
||||||
// Need to update the cap values for host of the finishedTask
|
// Need to update the cap values for host of the finishedTask
|
||||||
bpPistonMutex.Lock()
|
bpPistonMutex.Lock()
|
||||||
bpPistonCapValues[hostOfFinishedTask] -= ((finishedTask.Watts * constants.CapMargin) / s.totalPower[hostOfFinishedTask]) * 100
|
bpPistonCapValues[hostOfFinishedTask] -= ((wattsConsideration * constants.Tolerance) / s.totalPower[hostOfFinishedTask]) * 100
|
||||||
// Checking to see if the cap value has become 0, in which case we uncap the host.
|
// Checking to see if the cap value has become 0, in which case we uncap the host.
|
||||||
if int(math.Floor(bpPistonCapValues[hostOfFinishedTask]+0.5)) == 0 {
|
if int(math.Floor(bpPistonCapValues[hostOfFinishedTask]+0.5)) == 0 {
|
||||||
bpPistonCapValues[hostOfFinishedTask] = 100
|
bpPistonCapValues[hostOfFinishedTask] = 100
|
||||||
|
|
|
@ -16,26 +16,32 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *BinPackSortedWatts) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWatts float64, task def.Task) bool {
|
func (s *BinPackSortedWatts) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.Watts))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || (watts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
type BinPackSortedWatts struct {
|
type BinPackSortedWatts struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -55,7 +61,7 @@ type BinPackSortedWatts struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBinPackSortedWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BinPackSortedWatts {
|
func NewBinPackSortedWatts(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *BinPackSortedWatts {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -64,14 +70,15 @@ func NewBinPackSortedWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BinPackSortedWatts{
|
s := &BinPackSortedWatts{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -99,8 +106,14 @@ func (s *BinPackSortedWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.T
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsToConsider
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -145,6 +158,11 @@ func (s *BinPackSortedWatts) ResourceOffers(driver sched.SchedulerDriver, offers
|
||||||
totalRAM := 0.0
|
totalRAM := 0.0
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
@ -153,10 +171,10 @@ func (s *BinPackSortedWatts) ResourceOffers(driver sched.SchedulerDriver, offers
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, task) {
|
if s.takeOffer(offer, task) {
|
||||||
|
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
totalWatts += task.Watts
|
totalWatts += wattsConsideration
|
||||||
totalCPU += task.CPU
|
totalCPU += task.CPU
|
||||||
totalRAM += task.RAM
|
totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
|
|
@ -26,12 +26,12 @@ BinPacking has the most effect when co-scheduling of tasks is increased. Large t
|
||||||
co-scheduling them has a great impact on the total power utilization.
|
co-scheduling them has a great impact on the total power utilization.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
func (s *BottomHeavy) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWatts,
|
func (s *BottomHeavy) takeOfferBinPack(offer *mesos.Offer, totalCPU, totalRAM, totalWatts,
|
||||||
wattsToConsider float64, task def.Task) bool {
|
wattsToConsider float64, task def.Task) bool {
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + wattsToConsider))) &&
|
if (!s.wattsAsAResource || (offerWatts >= (totalWatts + wattsToConsider))) &&
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
(offerCPU >= (totalCPU + task.CPU)) &&
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
(offerRAM >= (totalRAM + task.RAM)) {
|
||||||
return true
|
return true
|
||||||
|
@ -40,6 +40,17 @@ func (s *BottomHeavy) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWat
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func (s *BottomHeavy) takeOfferFirstFit(offer *mesos.Offer, wattsConsideration float64, task def.Task) bool {
|
||||||
|
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
if (!s.wattsAsAResource || (offerWatts >= wattsConsideration)) &&
|
||||||
|
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type BottomHeavy struct {
|
type BottomHeavy struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
|
@ -48,7 +59,8 @@ type BottomHeavy struct {
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
smallTasks, largeTasks []def.Task
|
smallTasks, largeTasks []def.Task
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
|
@ -69,7 +81,7 @@ type BottomHeavy struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBottomHeavy(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BottomHeavy {
|
func NewBottomHeavy(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *BottomHeavy {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -81,20 +93,21 @@ func NewBottomHeavy(tasks []def.Task, ignoreWatts bool, schedTracePrefix string)
|
||||||
// Classification done based on MMPU watts requirements.
|
// Classification done based on MMPU watts requirements.
|
||||||
mid := int(math.Floor((float64(len(tasks)) / 2.0) + 0.5))
|
mid := int(math.Floor((float64(len(tasks)) / 2.0) + 0.5))
|
||||||
s := &BottomHeavy{
|
s := &BottomHeavy{
|
||||||
smallTasks: tasks[:mid],
|
smallTasks: tasks[:mid],
|
||||||
largeTasks: tasks[mid+1:],
|
largeTasks: tasks[mid+1:],
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BottomHeavy) newTask(offer *mesos.Offer, task def.Task, newTaskClass string) *mesos.TaskInfo {
|
func (s *BottomHeavy) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -117,8 +130,14 @@ func (s *BottomHeavy) newTask(offer *mesos.Offer, task def.Task, newTaskClass st
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[newTaskClass]))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -150,11 +169,10 @@ func (s *BottomHeavy) shutDownIfNecessary() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// create TaskInfo and log scheduling trace
|
// create TaskInfo and log scheduling trace
|
||||||
func (s *BottomHeavy) createTaskInfoAndLogSchedTrace(offer *mesos.Offer,
|
func (s *BottomHeavy) createTaskInfoAndLogSchedTrace(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
powerClass string, task def.Task) *mesos.TaskInfo {
|
|
||||||
log.Println("Co-Located with:")
|
log.Println("Co-Located with:")
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
coLocated(s.running[offer.GetSlaveId().GoString()])
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
taskToSchedule := s.newTask(offer, task)
|
||||||
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
fmt.Println("Inst: ", *task.Instances)
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
||||||
|
@ -182,22 +200,22 @@ func (s *BottomHeavy) pack(offers []*mesos.Offer, driver sched.SchedulerDriver)
|
||||||
offerTaken := false
|
offerTaken := false
|
||||||
for i := 0; i < len(s.largeTasks); i++ {
|
for i := 0; i < len(s.largeTasks); i++ {
|
||||||
task := s.largeTasks[i]
|
task := s.largeTasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
// OR lazy evaluation. If ignore watts is set to true, second statement won't
|
// OR lazy evaluation. If ignore watts is set to true, second statement won't
|
||||||
// be evaluated.
|
// be evaluated.
|
||||||
wattsToConsider := task.Watts
|
if s.takeOfferBinPack(offer, totalCPU, totalRAM, totalWatts, wattsConsideration, task) {
|
||||||
if !s.ignoreWatts {
|
|
||||||
wattsToConsider = task.ClassToWatts[powerClass]
|
|
||||||
}
|
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, wattsToConsider, task) {
|
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
totalWatts += wattsToConsider
|
totalWatts += wattsConsideration
|
||||||
totalCPU += task.CPU
|
totalCPU += task.CPU
|
||||||
totalRAM += task.RAM
|
totalRAM += task.RAM
|
||||||
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, powerClass, task))
|
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, task))
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
if *task.Instances <= 0 {
|
||||||
// All instances of task have been scheduled, remove it
|
// All instances of task have been scheduled, remove it
|
||||||
|
@ -238,21 +256,19 @@ func (s *BottomHeavy) spread(offers []*mesos.Offer, driver sched.SchedulerDriver
|
||||||
}
|
}
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
tasks := []*mesos.TaskInfo{}
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
taken := false
|
taken := false
|
||||||
for i := 0; i < len(s.smallTasks); i++ {
|
for i := 0; i < len(s.smallTasks); i++ {
|
||||||
task := s.smallTasks[i]
|
task := s.smallTasks[i]
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Decision to take the offer or not
|
// Decision to take the offer or not
|
||||||
wattsToConsider := task.Watts
|
if s.takeOfferFirstFit(offer, wattsConsideration, task) {
|
||||||
if !s.ignoreWatts {
|
|
||||||
wattsToConsider = task.ClassToWatts[powerClass]
|
|
||||||
}
|
|
||||||
if (s.ignoreWatts || (offerWatts >= wattsToConsider)) &&
|
|
||||||
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
|
||||||
taken = true
|
taken = true
|
||||||
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, powerClass, task))
|
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, task))
|
||||||
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
||||||
|
|
||||||
|
@ -297,10 +313,10 @@ func (s *BottomHeavy) ResourceOffers(driver sched.SchedulerDriver, offers []*mes
|
||||||
default:
|
default:
|
||||||
}
|
}
|
||||||
|
|
||||||
if constants.PowerClasses["ClassA"][*offer.Hostname] ||
|
if constants.PowerClasses["A"][*offer.Hostname] ||
|
||||||
constants.PowerClasses["ClassB"][*offer.Hostname] {
|
constants.PowerClasses["B"][*offer.Hostname] {
|
||||||
offersClassAB = append(offersClassAB, offer)
|
offersClassAB = append(offersClassAB, offer)
|
||||||
} else if constants.PowerClasses["ClassC"][*offer.Hostname] {
|
} else if constants.PowerClasses["C"][*offer.Hostname] {
|
||||||
offersClassC = append(offersClassC, offer)
|
offersClassC = append(offersClassC, offer)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,223 +0,0 @@
|
||||||
package schedulers
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/mesosUtils"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
"fmt"
|
|
||||||
"github.com/golang/protobuf/proto"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"github.com/mesos/mesos-go/mesosutil"
|
|
||||||
sched "github.com/mesos/mesos-go/scheduler"
|
|
||||||
"log"
|
|
||||||
"os"
|
|
||||||
"sort"
|
|
||||||
"time"
|
|
||||||
)
|
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
|
||||||
func (s *BPSWClassMapWatts) takeOffer(offer *mesos.Offer, totalCPU, totalRAM,
|
|
||||||
totalWatts float64, powerClass string, task def.Task) bool {
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.ClassToWatts[powerClass]))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
type BPSWClassMapWatts struct {
|
|
||||||
base // Type embedded to inherit common functions
|
|
||||||
tasksCreated int
|
|
||||||
tasksRunning int
|
|
||||||
tasks []def.Task
|
|
||||||
metrics map[string]def.Metric
|
|
||||||
running map[string]map[string]bool
|
|
||||||
ignoreWatts bool
|
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
|
||||||
// about to schedule a new task
|
|
||||||
RecordPCP bool
|
|
||||||
|
|
||||||
// This channel is closed when the program receives an interrupt,
|
|
||||||
// signalling that the program should shut down.
|
|
||||||
Shutdown chan struct{}
|
|
||||||
// This channel is closed after shutdown is closed, and only when all
|
|
||||||
// outstanding tasks have been cleaned up
|
|
||||||
Done chan struct{}
|
|
||||||
|
|
||||||
// Controls when to shutdown pcp logging
|
|
||||||
PCPLog chan struct{}
|
|
||||||
|
|
||||||
schedTrace *log.Logger
|
|
||||||
}
|
|
||||||
|
|
||||||
// New electron scheduler
|
|
||||||
func NewBPSWClassMapWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPSWClassMapWatts {
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatal(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s := &BPSWClassMapWatts{
|
|
||||||
tasks: tasks,
|
|
||||||
ignoreWatts: ignoreWatts,
|
|
||||||
Shutdown: make(chan struct{}),
|
|
||||||
Done: make(chan struct{}),
|
|
||||||
PCPLog: make(chan struct{}),
|
|
||||||
running: make(map[string]map[string]bool),
|
|
||||||
RecordPCP: false,
|
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
|
||||||
}
|
|
||||||
return s
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWatts) newTask(offer *mesos.Offer, task def.Task, powerClass string) *mesos.TaskInfo {
|
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
|
||||||
s.tasksCreated++
|
|
||||||
|
|
||||||
if !s.RecordPCP {
|
|
||||||
// Turn on logging
|
|
||||||
s.RecordPCP = true
|
|
||||||
time.Sleep(1 * time.Second) // Make sure we're recording by the time the first task starts
|
|
||||||
}
|
|
||||||
|
|
||||||
// If this is our first time running into this Agent
|
|
||||||
if _, ok := s.running[offer.GetSlaveId().GoString()]; !ok {
|
|
||||||
s.running[offer.GetSlaveId().GoString()] = make(map[string]bool)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Add task to list of tasks running on node
|
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
|
||||||
|
|
||||||
resources := []*mesos.Resource{
|
|
||||||
mesosutil.NewScalarResource("cpus", task.CPU),
|
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
|
||||||
}
|
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[powerClass]))
|
|
||||||
}
|
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
|
||||||
Name: proto.String(taskName),
|
|
||||||
TaskId: &mesos.TaskID{
|
|
||||||
Value: proto.String("electron-" + taskName),
|
|
||||||
},
|
|
||||||
SlaveId: offer.SlaveId,
|
|
||||||
Resources: resources,
|
|
||||||
Command: &mesos.CommandInfo{
|
|
||||||
Value: proto.String(task.CMD),
|
|
||||||
},
|
|
||||||
Container: &mesos.ContainerInfo{
|
|
||||||
Type: mesos.ContainerInfo_DOCKER.Enum(),
|
|
||||||
Docker: &mesos.ContainerInfo_DockerInfo{
|
|
||||||
Image: proto.String(task.Image),
|
|
||||||
Network: mesos.ContainerInfo_DockerInfo_BRIDGE.Enum(), // Run everything isolated
|
|
||||||
},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
|
||||||
|
|
||||||
for _, offer := range offers {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
log.Println("Done scheduling tasks: declining offer on [", offer.GetHostname(), "]")
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.LongFilter)
|
|
||||||
|
|
||||||
log.Println("Number of tasks still running: ", s.tasksRunning)
|
|
||||||
continue
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
|
||||||
|
|
||||||
offerTaken := false
|
|
||||||
totalWatts := 0.0
|
|
||||||
totalCPU := 0.0
|
|
||||||
totalRAM := 0.0
|
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
|
||||||
task := s.tasks[i]
|
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
// Does the task fit
|
|
||||||
// OR lazy evaluation. If ignore watts is set to true, second statement won't
|
|
||||||
// be evaluated.
|
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, powerClass, task) {
|
|
||||||
|
|
||||||
fmt.Println("Watts being used: ", task.ClassToWatts[powerClass])
|
|
||||||
offerTaken = true
|
|
||||||
totalWatts += task.ClassToWatts[powerClass]
|
|
||||||
totalCPU += task.CPU
|
|
||||||
totalRAM += task.RAM
|
|
||||||
log.Println("Co-Located with: ")
|
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
|
||||||
tasks = append(tasks, taskToSchedule)
|
|
||||||
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
|
||||||
*task.Instances--
|
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
|
||||||
// All instances of task have been scheduled, remove it
|
|
||||||
s.tasks = append(s.tasks[:i], s.tasks[i+1:]...)
|
|
||||||
|
|
||||||
if len(s.tasks) <= 0 {
|
|
||||||
log.Println("Done scheduling all tasks")
|
|
||||||
close(s.Shutdown)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
break // Continue on to next task
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if offerTaken {
|
|
||||||
log.Printf("Starting on [%s]\n", offer.GetHostname())
|
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
|
||||||
} else {
|
|
||||||
|
|
||||||
// If there was no match for the task
|
|
||||||
fmt.Println("There is not enough resources to launch a task:")
|
|
||||||
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
log.Printf("<CPU: %f, RAM: %f, Watts: %f>\n", cpus, mem, watts)
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.DefaultFilter)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWatts) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
||||||
s.tasksRunning++
|
|
||||||
} else if IsTerminal(status.State) {
|
|
||||||
delete(s.running[status.GetSlaveId().GoString()], *status.TaskId.Value)
|
|
||||||
s.tasksRunning--
|
|
||||||
if s.tasksRunning == 0 {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
close(s.Done)
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("DONE: Task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
}
|
|
|
@ -1,384 +0,0 @@
|
||||||
package schedulers
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bitbucket.org/sunybingcloud/electron/constants"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/rapl"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/mesosUtils"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
"errors"
|
|
||||||
"fmt"
|
|
||||||
"github.com/golang/protobuf/proto"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"github.com/mesos/mesos-go/mesosutil"
|
|
||||||
sched "github.com/mesos/mesos-go/scheduler"
|
|
||||||
"log"
|
|
||||||
"math"
|
|
||||||
"os"
|
|
||||||
"sort"
|
|
||||||
"sync"
|
|
||||||
"time"
|
|
||||||
)
|
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) takeOffer(offer *mesos.Offer, totalCPU, totalRAM,
|
|
||||||
totalWatts float64, powerClass string, task def.Task) bool {
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.ClassToWatts[powerClass]))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
type BPSWClassMapWattsPistonCapping struct {
|
|
||||||
base // Type embedded to inherit common functions
|
|
||||||
tasksCreated int
|
|
||||||
tasksRunning int
|
|
||||||
tasks []def.Task
|
|
||||||
metrics map[string]def.Metric
|
|
||||||
running map[string]map[string]bool
|
|
||||||
taskMonitor map[string][]def.Task
|
|
||||||
totalPower map[string]float64
|
|
||||||
ignoreWatts bool
|
|
||||||
ticker *time.Ticker
|
|
||||||
isCapping bool
|
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
|
||||||
// about to schedule the new task
|
|
||||||
RecordPCP bool
|
|
||||||
|
|
||||||
// This channel is closed when the program receives an interrupt,
|
|
||||||
// signalling that program should shutdown
|
|
||||||
Shutdown chan struct{}
|
|
||||||
|
|
||||||
// This channel is closed after shutdown is closed, and only when all
|
|
||||||
// outstanding tasks have been cleaned up
|
|
||||||
Done chan struct{}
|
|
||||||
|
|
||||||
// Controls when to shutdown pcp logging
|
|
||||||
PCPLog chan struct{}
|
|
||||||
|
|
||||||
schedTrace *log.Logger
|
|
||||||
}
|
|
||||||
|
|
||||||
// New electron scheduler
|
|
||||||
func NewBPSWClassMapWattsPistonCapping(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPSWClassMapWattsPistonCapping {
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatal(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s := &BPSWClassMapWattsPistonCapping{
|
|
||||||
tasks: tasks,
|
|
||||||
ignoreWatts: ignoreWatts,
|
|
||||||
Shutdown: make(chan struct{}),
|
|
||||||
Done: make(chan struct{}),
|
|
||||||
PCPLog: make(chan struct{}),
|
|
||||||
running: make(map[string]map[string]bool),
|
|
||||||
taskMonitor: make(map[string][]def.Task),
|
|
||||||
totalPower: make(map[string]float64),
|
|
||||||
RecordPCP: false,
|
|
||||||
ticker: time.NewTicker(5 * time.Second),
|
|
||||||
isCapping: false,
|
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
|
||||||
}
|
|
||||||
return s
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) newTask(offer *mesos.Offer, task def.Task, powerClass string) *mesos.TaskInfo {
|
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
|
||||||
s.tasksCreated++
|
|
||||||
|
|
||||||
if !s.RecordPCP {
|
|
||||||
// Turn on logging
|
|
||||||
s.RecordPCP = true
|
|
||||||
time.Sleep(1 * time.Second) // Make sure we're recording by the time the first task starts
|
|
||||||
}
|
|
||||||
|
|
||||||
// If this is our first time running into this Agent
|
|
||||||
if _, ok := s.running[offer.GetSlaveId().GoString()]; !ok {
|
|
||||||
s.running[offer.GetSlaveId().GoString()] = make(map[string]bool)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Add task to list of tasks running on node
|
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
|
||||||
|
|
||||||
// Setting the task ID to the task. This is done so that we can consider each task to be different
|
|
||||||
// even though they have the same parameters.
|
|
||||||
task.SetTaskID(*proto.String("electron-" + taskName))
|
|
||||||
// Add task to list of tasks running on node
|
|
||||||
if len(s.taskMonitor[*offer.Hostname]) == 0 {
|
|
||||||
s.taskMonitor[*offer.Hostname] = []def.Task{task}
|
|
||||||
} else {
|
|
||||||
s.taskMonitor[*offer.Hostname] = append(s.taskMonitor[*offer.Hostname], task)
|
|
||||||
}
|
|
||||||
|
|
||||||
resources := []*mesos.Resource{
|
|
||||||
mesosutil.NewScalarResource("cpus", task.CPU),
|
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
|
||||||
}
|
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[powerClass]))
|
|
||||||
}
|
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
|
||||||
Name: proto.String(taskName),
|
|
||||||
TaskId: &mesos.TaskID{
|
|
||||||
Value: proto.String("electron-" + taskName),
|
|
||||||
},
|
|
||||||
SlaveId: offer.SlaveId,
|
|
||||||
Resources: resources,
|
|
||||||
Command: &mesos.CommandInfo{
|
|
||||||
Value: proto.String(task.CMD),
|
|
||||||
},
|
|
||||||
Container: &mesos.ContainerInfo{
|
|
||||||
Type: mesos.ContainerInfo_DOCKER.Enum(),
|
|
||||||
Docker: &mesos.ContainerInfo_DockerInfo{
|
|
||||||
Image: proto.String(task.Image),
|
|
||||||
Network: mesos.ContainerInfo_DockerInfo_BRIDGE.Enum(), // Run everything isolated
|
|
||||||
},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) Disconnected(sched.SchedulerDriver) {
|
|
||||||
// Need to stop the capping process
|
|
||||||
s.ticker.Stop()
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
log.Println("Framework disconnected with master")
|
|
||||||
}
|
|
||||||
|
|
||||||
// mutex
|
|
||||||
var bpswClassMapWattsPistonMutex sync.Mutex
|
|
||||||
|
|
||||||
// go routine to cap each node in the cluster at regular intervals of time
|
|
||||||
var bpswClassMapWattsPistonCapValues = make(map[string]float64)
|
|
||||||
|
|
||||||
// Storing the previous cap value for each host so as to not repeatedly cap the nodes to the same value. (reduces overhead)
|
|
||||||
var bpswClassMapWattsPistonPreviousRoundedCapValues = make(map[string]int)
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) startCapping() {
|
|
||||||
go func() {
|
|
||||||
for {
|
|
||||||
select {
|
|
||||||
case <-s.ticker.C:
|
|
||||||
// Need to cap each node
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
for host, capValue := range bpswClassMapWattsPistonCapValues {
|
|
||||||
roundedCapValue := int(math.Floor(capValue + 0.5))
|
|
||||||
// has the cap value changed
|
|
||||||
if previousRoundedCap, ok := bpswClassMapWattsPistonPreviousRoundedCapValues[host]; ok {
|
|
||||||
if previousRoundedCap != roundedCapValue {
|
|
||||||
if err := rapl.Cap(host, "rapl", roundedCapValue); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
} else {
|
|
||||||
log.Printf("Capped [%s] at %d", host, roundedCapValue)
|
|
||||||
}
|
|
||||||
bpswClassMapWattsPistonPreviousRoundedCapValues[host] = roundedCapValue
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if err := rapl.Cap(host, "rapl", roundedCapValue); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
} else {
|
|
||||||
log.Printf("Capped [%s] at %d", host, roundedCapValue)
|
|
||||||
}
|
|
||||||
bpswClassMapWattsPistonPreviousRoundedCapValues[host] = roundedCapValue
|
|
||||||
}
|
|
||||||
}
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stop the capping
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) stopCapping() {
|
|
||||||
if s.isCapping {
|
|
||||||
log.Println("Stopping the capping.")
|
|
||||||
s.ticker.Stop()
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
|
||||||
|
|
||||||
// retrieving the total power for each host in the offers.
|
|
||||||
for _, offer := range offers {
|
|
||||||
if _, ok := s.totalPower[*offer.Hostname]; !ok {
|
|
||||||
_, _, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
s.totalPower[*offer.Hostname] = offerWatts
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Displaying the totalPower
|
|
||||||
for host, tpower := range s.totalPower {
|
|
||||||
log.Printf("TotalPower[%s] = %f", host, tpower)
|
|
||||||
}
|
|
||||||
|
|
||||||
for _, offer := range offers {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
log.Println("Done scheduling tasks: declining offer on [", offer.GetHostname(), "]")
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.LongFilter)
|
|
||||||
|
|
||||||
log.Println("Number of tasks still running: ", s.tasksRunning)
|
|
||||||
continue
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
|
||||||
|
|
||||||
offerTaken := false
|
|
||||||
totalWatts := 0.0
|
|
||||||
totalCPU := 0.0
|
|
||||||
totalRAM := 0.0
|
|
||||||
// Store the partialLoad for host corresponding to this offer
|
|
||||||
// Once we can't fit any more tasks, we update the capValue for this host with partialLoad and then launch the fitted tasks.
|
|
||||||
partialLoad := 0.0
|
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
|
||||||
task := s.tasks[i]
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
// Does the task fit
|
|
||||||
// OR lazy evaluation. If ignoreWatts is set to true, second statement won't
|
|
||||||
// be evaluated
|
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, powerClass, task) {
|
|
||||||
|
|
||||||
// Start piston capping if haven't started yet
|
|
||||||
if !s.isCapping {
|
|
||||||
s.isCapping = true
|
|
||||||
s.startCapping()
|
|
||||||
}
|
|
||||||
|
|
||||||
fmt.Println("Watts being used: ", task.ClassToWatts[powerClass])
|
|
||||||
offerTaken = true
|
|
||||||
totalWatts += task.ClassToWatts[powerClass]
|
|
||||||
totalCPU += task.CPU
|
|
||||||
totalRAM += task.RAM
|
|
||||||
log.Println("Co-Located with: ")
|
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
|
||||||
tasks = append(tasks, taskToSchedule)
|
|
||||||
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
|
||||||
*task.Instances--
|
|
||||||
partialLoad += ((task.Watts * constants.CapMargin) / s.totalPower[*offer.Hostname]) * 100
|
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
|
||||||
// All instances of task have been scheduled. Remove it
|
|
||||||
s.tasks = append(s.tasks[:i], s.tasks[i+1:]...)
|
|
||||||
if len(s.tasks) <= 0 {
|
|
||||||
log.Println("Done scheduling all tasks")
|
|
||||||
close(s.Shutdown)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
break // Continue on to the next task
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if offerTaken {
|
|
||||||
// Updating the cap value for offer.Hostname
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
bpswClassMapWattsPistonCapValues[*offer.Hostname] += partialLoad
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
log.Printf("Starting on [%s]\n", offer.GetHostname())
|
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
|
||||||
} else {
|
|
||||||
// If there was no match for task
|
|
||||||
log.Println("There is not enough resources to launch task: ")
|
|
||||||
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
log.Printf("<CPU: %f, RAM: %f, Watts: %f>\n", cpus, mem, watts)
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.DefaultFilter)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Remove finished task from the taskMonitor
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) deleteFromTaskMonitor(finishedTaskID string) (def.Task, string, error) {
|
|
||||||
hostOfFinishedTask := ""
|
|
||||||
indexOfFinishedTask := -1
|
|
||||||
found := false
|
|
||||||
var finishedTask def.Task
|
|
||||||
|
|
||||||
for host, tasks := range s.taskMonitor {
|
|
||||||
for i, task := range tasks {
|
|
||||||
if task.TaskID == finishedTaskID {
|
|
||||||
hostOfFinishedTask = host
|
|
||||||
indexOfFinishedTask = i
|
|
||||||
found = true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if found {
|
|
||||||
break
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if hostOfFinishedTask != "" && indexOfFinishedTask != -1 {
|
|
||||||
finishedTask = s.taskMonitor[hostOfFinishedTask][indexOfFinishedTask]
|
|
||||||
log.Printf("Removing task with TaskID [%s] from the list of running tasks\n",
|
|
||||||
s.taskMonitor[hostOfFinishedTask][indexOfFinishedTask].TaskID)
|
|
||||||
s.taskMonitor[hostOfFinishedTask] = append(s.taskMonitor[hostOfFinishedTask][:indexOfFinishedTask],
|
|
||||||
s.taskMonitor[hostOfFinishedTask][indexOfFinishedTask+1:]...)
|
|
||||||
} else {
|
|
||||||
return finishedTask, hostOfFinishedTask, errors.New("Finished Task not present in TaskMonitor")
|
|
||||||
}
|
|
||||||
return finishedTask, hostOfFinishedTask, nil
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsPistonCapping) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
|
||||||
log.Printf("Received task status [%s] for task [%s]\n", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
s.tasksRunning++
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
} else if IsTerminal(status.State) {
|
|
||||||
delete(s.running[status.GetSlaveId().GoString()], *status.TaskId.Value)
|
|
||||||
// Deleting the task from the taskMonitor
|
|
||||||
finishedTask, hostOfFinishedTask, err := s.deleteFromTaskMonitor(*status.TaskId.Value)
|
|
||||||
if err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Need to update the cap values for host of the finishedTask
|
|
||||||
bpswClassMapWattsPistonMutex.Lock()
|
|
||||||
bpswClassMapWattsPistonCapValues[hostOfFinishedTask] -= ((finishedTask.Watts * constants.CapMargin) / s.totalPower[hostOfFinishedTask]) * 100
|
|
||||||
// Checking to see if the cap value has become 0, in which case we uncap the host.
|
|
||||||
if int(math.Floor(bpswClassMapWattsPistonCapValues[hostOfFinishedTask]+0.5)) == 0 {
|
|
||||||
bpswClassMapWattsPistonCapValues[hostOfFinishedTask] = 100
|
|
||||||
}
|
|
||||||
s.tasksRunning--
|
|
||||||
bpswClassMapWattsPistonMutex.Unlock()
|
|
||||||
|
|
||||||
if s.tasksRunning == 0 {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
s.stopCapping()
|
|
||||||
close(s.Done)
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("DONE: Task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
}
|
|
|
@ -1,403 +0,0 @@
|
||||||
package schedulers
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bitbucket.org/sunybingcloud/electron/constants"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
powCap "bitbucket.org/sunybingcloud/electron/powerCapping"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/rapl"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/mesosUtils"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
"fmt"
|
|
||||||
"github.com/golang/protobuf/proto"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"github.com/mesos/mesos-go/mesosutil"
|
|
||||||
sched "github.com/mesos/mesos-go/scheduler"
|
|
||||||
"log"
|
|
||||||
"math"
|
|
||||||
"os"
|
|
||||||
"sort"
|
|
||||||
"sync"
|
|
||||||
"time"
|
|
||||||
)
|
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
|
||||||
func (s *BPSWClassMapWattsProacCC) takeOffer(offer *mesos.Offer, totalCPU, totalRAM,
|
|
||||||
totalWatts float64, powerClass string, task def.Task) bool {
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.ClassToWatts[powerClass]))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
type BPSWClassMapWattsProacCC struct {
|
|
||||||
base // Type embedding to inherit common functions
|
|
||||||
tasksCreated int
|
|
||||||
tasksRunning int
|
|
||||||
tasks []def.Task
|
|
||||||
metrics map[string]def.Metric
|
|
||||||
running map[string]map[string]bool
|
|
||||||
taskMonitor map[string][]def.Task
|
|
||||||
availablePower map[string]float64
|
|
||||||
totalPower map[string]float64
|
|
||||||
ignoreWatts bool
|
|
||||||
capper *powCap.ClusterwideCapper
|
|
||||||
ticker *time.Ticker
|
|
||||||
recapTicker *time.Ticker
|
|
||||||
isCapping bool // indicate whether we are currently performing cluster-wide capping.
|
|
||||||
isRecapping bool // indicate whether we are currently performing cluster-wide recapping.
|
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
|
||||||
// about to schedule a new task
|
|
||||||
RecordPCP bool
|
|
||||||
|
|
||||||
// This channel is closed when the program receives an interrupt,
|
|
||||||
// signalling that the program should shut down
|
|
||||||
Shutdown chan struct{}
|
|
||||||
// This channel is closed after shutdown is closed, and only when all
|
|
||||||
// outstanding tasks have been cleaned up
|
|
||||||
Done chan struct{}
|
|
||||||
|
|
||||||
// Controls when to shutdown pcp logging
|
|
||||||
PCPLog chan struct{}
|
|
||||||
|
|
||||||
schedTrace *log.Logger
|
|
||||||
}
|
|
||||||
|
|
||||||
// New electron scheduler
|
|
||||||
func NewBPSWClassMapWattsProacCC(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPSWClassMapWattsProacCC {
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatal(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s := &BPSWClassMapWattsProacCC{
|
|
||||||
tasks: tasks,
|
|
||||||
ignoreWatts: ignoreWatts,
|
|
||||||
Shutdown: make(chan struct{}),
|
|
||||||
Done: make(chan struct{}),
|
|
||||||
PCPLog: make(chan struct{}),
|
|
||||||
running: make(map[string]map[string]bool),
|
|
||||||
taskMonitor: make(map[string][]def.Task),
|
|
||||||
availablePower: make(map[string]float64),
|
|
||||||
totalPower: make(map[string]float64),
|
|
||||||
RecordPCP: false,
|
|
||||||
capper: powCap.GetClusterwideCapperInstance(),
|
|
||||||
ticker: time.NewTicker(10 * time.Second),
|
|
||||||
recapTicker: time.NewTicker(20 * time.Second),
|
|
||||||
isCapping: false,
|
|
||||||
isRecapping: false,
|
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
|
||||||
}
|
|
||||||
return s
|
|
||||||
}
|
|
||||||
|
|
||||||
// mutex
|
|
||||||
var bpswClassMapWattsProacCCMutex sync.Mutex
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsProacCC) newTask(offer *mesos.Offer, task def.Task, powerClass string) *mesos.TaskInfo {
|
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
|
||||||
s.tasksCreated++
|
|
||||||
|
|
||||||
if !s.RecordPCP {
|
|
||||||
// Turn on logging.
|
|
||||||
s.RecordPCP = true
|
|
||||||
time.Sleep(1 * time.Second) // Make sure we're recording by the time the first task starts
|
|
||||||
}
|
|
||||||
|
|
||||||
// If this is our first time running into this Agent
|
|
||||||
if _, ok := s.running[offer.GetSlaveId().GoString()]; !ok {
|
|
||||||
s.running[offer.GetSlaveId().GoString()] = make(map[string]bool)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Setting the task ID to the task. This is done so that we can consider each task to be different,
|
|
||||||
// even though they have the same parameters.
|
|
||||||
task.SetTaskID(*proto.String("electron-" + taskName))
|
|
||||||
// Add task to the list of tasks running on the node.
|
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
|
||||||
if len(s.taskMonitor[*offer.Hostname]) == 0 {
|
|
||||||
s.taskMonitor[*offer.Hostname] = []def.Task{task}
|
|
||||||
} else {
|
|
||||||
s.taskMonitor[*offer.Hostname] = append(s.taskMonitor[*offer.Hostname], task)
|
|
||||||
}
|
|
||||||
|
|
||||||
resources := []*mesos.Resource{
|
|
||||||
mesosutil.NewScalarResource("cpus", task.CPU),
|
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
|
||||||
}
|
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[powerClass]))
|
|
||||||
}
|
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
|
||||||
Name: proto.String(taskName),
|
|
||||||
TaskId: &mesos.TaskID{
|
|
||||||
Value: proto.String("electron-" + taskName),
|
|
||||||
},
|
|
||||||
SlaveId: offer.SlaveId,
|
|
||||||
Resources: resources,
|
|
||||||
Command: &mesos.CommandInfo{
|
|
||||||
Value: proto.String(task.CMD),
|
|
||||||
},
|
|
||||||
Container: &mesos.ContainerInfo{
|
|
||||||
Type: mesos.ContainerInfo_DOCKER.Enum(),
|
|
||||||
Docker: &mesos.ContainerInfo_DockerInfo{
|
|
||||||
Image: proto.String(task.Image),
|
|
||||||
Network: mesos.ContainerInfo_DockerInfo_BRIDGE.Enum(), // Run everything isolated
|
|
||||||
},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsProacCC) Disconnected(sched.SchedulerDriver) {
|
|
||||||
// Need to stop the capping process
|
|
||||||
s.ticker.Stop()
|
|
||||||
s.recapTicker.Stop()
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
log.Println("Framework disconnected with master")
|
|
||||||
}
|
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
|
||||||
var bpswClassMapWattsProacCCCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
|
||||||
var bpswClassMapWattsProacCCNewCapValue = 0.0 // newly computed cap value
|
|
||||||
func (s *BPSWClassMapWattsProacCC) startCapping() {
|
|
||||||
go func() {
|
|
||||||
for {
|
|
||||||
select {
|
|
||||||
case <-s.ticker.C:
|
|
||||||
// Need to cap the cluster only if new cap value different from old cap value.
|
|
||||||
// This way we don't unnecessarily cap the cluster.
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
if s.isCapping {
|
|
||||||
if int(math.Floor(bpswClassMapWattsProacCCNewCapValue+0.5)) != int(math.Floor(bpswClassMapWattsProacCCCapValue+0.5)) {
|
|
||||||
// updating cap value
|
|
||||||
bpswClassMapWattsProacCCCapValue = bpswClassMapWattsProacCCNewCapValue
|
|
||||||
if bpswClassMapWattsProacCCCapValue > 0.0 {
|
|
||||||
for _, host := range constants.Hosts {
|
|
||||||
// Rounding cap value to nearest int
|
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(bpswClassMapWattsProacCCCapValue+0.5))); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("Capped the cluster to %d", int(math.Floor(bpswClassMapWattsProacCCCapValue+0.5)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
|
||||||
|
|
||||||
// go routine to recap the entire cluster in regular intervals of time.
|
|
||||||
var bpswClassMapWattsProacCCRecapValue = 0.0 // The cluster-wide cap value when recapping
|
|
||||||
func (s *BPSWClassMapWattsProacCC) startRecapping() {
|
|
||||||
go func() {
|
|
||||||
for {
|
|
||||||
select {
|
|
||||||
case <-s.recapTicker.C:
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
// If stopped performing cluster wide capping, then we need to recap
|
|
||||||
if s.isRecapping && bpswClassMapWattsProacCCRecapValue > 0.0 {
|
|
||||||
for _, host := range constants.Hosts {
|
|
||||||
// Rounding capValue to the nearest int
|
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(bpswClassMapWattsProacCCRecapValue+0.5))); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("Recapping the cluster to %d", int(math.Floor(bpswClassMapWattsProacCCRecapValue+0.5)))
|
|
||||||
}
|
|
||||||
// Setting recapping to false
|
|
||||||
s.isRecapping = false
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stop cluster wide capping
|
|
||||||
func (s *BPSWClassMapWattsProacCC) stopCapping() {
|
|
||||||
if s.isCapping {
|
|
||||||
log.Println("Stopping the cluster-wide capping.")
|
|
||||||
s.ticker.Stop()
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
s.isRecapping = true
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stop the cluster wide recapping
|
|
||||||
func (s *BPSWClassMapWattsProacCC) stopRecapping() {
|
|
||||||
// If not capping, then definitely recapping.
|
|
||||||
if !s.isCapping && s.isRecapping {
|
|
||||||
log.Println("Stopping the cluster-wide re-capping.")
|
|
||||||
s.recapTicker.Stop()
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = false
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
|
||||||
|
|
||||||
// retrieving the available power for all the hosts in the offers.
|
|
||||||
for _, offer := range offers {
|
|
||||||
_, _, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
s.availablePower[*offer.Hostname] = offerWatts
|
|
||||||
// setting total power if the first time
|
|
||||||
if _, ok := s.totalPower[*offer.Hostname]; !ok {
|
|
||||||
s.totalPower[*offer.Hostname] = offerWatts
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for host, tpower := range s.totalPower {
|
|
||||||
log.Printf("TotalPower[%s] = %f", host, tpower)
|
|
||||||
}
|
|
||||||
|
|
||||||
for _, offer := range offers {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
log.Println("Done scheduling tasks: declining offer on [", offer.GetHostname(), "]")
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.LongFilter)
|
|
||||||
|
|
||||||
log.Println("Number of tasks still running: ", s.tasksRunning)
|
|
||||||
continue
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
|
||||||
|
|
||||||
offerTaken := false
|
|
||||||
totalWatts := 0.0
|
|
||||||
totalCPU := 0.0
|
|
||||||
totalRAM := 0.0
|
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
|
||||||
task := s.tasks[i]
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
// Does the task fit
|
|
||||||
// OR Lazy evaluation. If ignore watts is set to true, second statement won't
|
|
||||||
// be evaluated.
|
|
||||||
if s.takeOffer(offer, totalCPU, totalRAM, totalWatts, powerClass, task) {
|
|
||||||
|
|
||||||
// Capping the cluster if haven't yet started
|
|
||||||
if !s.isCapping {
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = true
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
s.startCapping()
|
|
||||||
}
|
|
||||||
|
|
||||||
fmt.Println("Watts being used: ", task.ClassToWatts[powerClass])
|
|
||||||
tempCap, err := s.capper.FCFSDeterminedCap(s.totalPower, &task)
|
|
||||||
if err == nil {
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
bpswClassMapWattsProacCCNewCapValue = tempCap
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
} else {
|
|
||||||
log.Println("Failed to determine new cluster-wide cap:")
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
offerTaken = true
|
|
||||||
totalWatts += task.ClassToWatts[powerClass]
|
|
||||||
totalCPU += task.CPU
|
|
||||||
totalRAM += task.RAM
|
|
||||||
log.Println("Co-Located with: ")
|
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
|
||||||
tasks = append(tasks, taskToSchedule)
|
|
||||||
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
|
||||||
*task.Instances--
|
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
|
||||||
// All instances of task have been scheduled, remove it
|
|
||||||
s.tasks = append(s.tasks[:i], s.tasks[i+1:]...)
|
|
||||||
|
|
||||||
if len(s.tasks) == 0 {
|
|
||||||
log.Println("Done scheduling all tasks.")
|
|
||||||
// Need to stop the cluster wide capping as there aren't any more tasks to schedule.
|
|
||||||
s.stopCapping()
|
|
||||||
s.startRecapping() // Load changes after every task finishes and hence, we need to change the capping of the cluster.
|
|
||||||
close(s.Shutdown)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
break // Continue on to the next task
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if offerTaken {
|
|
||||||
log.Printf("Starting on [%s]\n", offer.GetHostname())
|
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
|
||||||
} else {
|
|
||||||
// If there was no match for the task
|
|
||||||
fmt.Println("There is not enough resources to launch a task:")
|
|
||||||
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
log.Printf("<CPU: %f, RAM: %f, Watts: %f>\n", cpus, mem, watts)
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.DefaultFilter)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *BPSWClassMapWattsProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
||||||
s.tasksRunning++
|
|
||||||
} else if IsTerminal(status.State) {
|
|
||||||
delete(s.running[status.GetSlaveId().GoString()], *status.TaskId.Value)
|
|
||||||
// Need to remove the task from the window
|
|
||||||
s.capper.TaskFinished(*status.TaskId.Value)
|
|
||||||
// Determining the new cluster wide recap value
|
|
||||||
//tempCap, err := s.capper.NaiveRecap(s.totalPower, s.taskMonitor, *status.TaskId.Value)
|
|
||||||
tempCap, err := s.capper.CleverRecap(s.totalPower, s.taskMonitor, *status.TaskId.Value)
|
|
||||||
if err == nil {
|
|
||||||
// If new determined cap value is different from the current recap value, then we need to recap
|
|
||||||
if int(math.Floor(tempCap+0.5)) != int(math.Floor(bpswClassMapWattsProacCCRecapValue+0.5)) {
|
|
||||||
bpswClassMapWattsProacCCRecapValue = tempCap
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = true
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
log.Printf("Determined re-cap value: %f\n", bpswClassMapWattsProacCCRecapValue)
|
|
||||||
} else {
|
|
||||||
bpswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = false
|
|
||||||
bpswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s.tasksRunning--
|
|
||||||
if s.tasksRunning == 0 {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
// Need to stop the cluster-wide recapping
|
|
||||||
s.stopRecapping()
|
|
||||||
close(s.Done)
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("DONE: Task status [%s] for task[%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
}
|
|
|
@ -16,26 +16,32 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *BPMaxMinWatts) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWatts float64, task def.Task) bool {
|
func (s *BPSWMaxMinWatts) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + task.Watts))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || (watts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
type BPMaxMinWatts struct {
|
type BPSWMaxMinWatts struct {
|
||||||
base //Type embedding to inherit common functions
|
base //Type embedding to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -55,7 +61,7 @@ type BPMaxMinWatts struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBPMaxMinWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPMaxMinWatts {
|
func NewBPMaxMinWatts(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *BPSWMaxMinWatts {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -63,20 +69,21 @@ func NewBPMaxMinWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix strin
|
||||||
log.Fatal(err)
|
log.Fatal(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BPMaxMinWatts{
|
s := &BPSWMaxMinWatts{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
func (s *BPSWMaxMinWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -100,8 +107,14 @@ func (s *BPMaxMinWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskIn
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -126,17 +139,19 @@ func (s *BPMaxMinWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskIn
|
||||||
|
|
||||||
// Determine if the remaining space inside of the offer is enough for this
|
// Determine if the remaining space inside of the offer is enough for this
|
||||||
// the task we need to create. If it is, create a TaskInfo and return it.
|
// the task we need to create. If it is, create a TaskInfo and return it.
|
||||||
func (s *BPMaxMinWatts) CheckFit(i int,
|
func (s *BPSWMaxMinWatts) CheckFit(
|
||||||
|
i int,
|
||||||
task def.Task,
|
task def.Task,
|
||||||
|
wattsConsideration float64,
|
||||||
offer *mesos.Offer,
|
offer *mesos.Offer,
|
||||||
totalCPU *float64,
|
totalCPU *float64,
|
||||||
totalRAM *float64,
|
totalRAM *float64,
|
||||||
totalWatts *float64) (bool, *mesos.TaskInfo) {
|
totalWatts *float64) (bool, *mesos.TaskInfo) {
|
||||||
|
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offer, *totalCPU, *totalRAM, *totalWatts, task) {
|
if s.takeOffer(offer, task) {
|
||||||
|
|
||||||
*totalWatts += task.Watts
|
*totalWatts += wattsConsideration
|
||||||
*totalCPU += task.CPU
|
*totalCPU += task.CPU
|
||||||
*totalRAM += task.RAM
|
*totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
@ -164,7 +179,7 @@ func (s *BPMaxMinWatts) CheckFit(i int,
|
||||||
return false, nil
|
return false, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
func (s *BPSWMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
log.Printf("Received %d resource offers", len(offers))
|
||||||
|
|
||||||
for _, offer := range offers {
|
for _, offer := range offers {
|
||||||
|
@ -192,13 +207,20 @@ func (s *BPMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*m
|
||||||
for i := len(s.tasks) - 1; i >= 0; i-- {
|
for i := len(s.tasks) - 1; i >= 0; i-- {
|
||||||
|
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -208,7 +230,13 @@ func (s *BPMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*m
|
||||||
}
|
}
|
||||||
|
|
||||||
// Pack the rest of the offer with the smallest tasks
|
// Pack the rest of the offer with the smallest tasks
|
||||||
for i, task := range s.tasks {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
@ -217,7 +245,8 @@ func (s *BPMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*m
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -243,7 +272,7 @@ func (s *BPMaxMinWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*m
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinWatts) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
func (s *BPSWMaxMinWatts) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
@ -21,31 +21,36 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *BPMaxMinPistonCapping) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWatts float64, task def.Task) bool {
|
func (s *BPSWMaxMinPistonCapping) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
// Does the task fit
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (*totalWatts + task.Watts))) &&
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
(offerCPU >= (*totalCPU + task.CPU)) &&
|
if err != nil {
|
||||||
(offerRAM >= (*totalRAM + task.RAM)) {
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || (watts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
type BPMaxMinPistonCapping struct {
|
type BPSWMaxMinPistonCapping struct {
|
||||||
base //Type embedding to inherit common functions
|
base //Type embedding to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
taskMonitor map[string][]def.Task
|
taskMonitor map[string][]def.Task
|
||||||
totalPower map[string]float64
|
totalPower map[string]float64
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
ticker *time.Ticker
|
classMapWatts bool
|
||||||
isCapping bool
|
ticker *time.Ticker
|
||||||
|
isCapping bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -65,7 +70,8 @@ type BPMaxMinPistonCapping struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBPMaxMinPistonCapping(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPMaxMinPistonCapping {
|
func NewBPSWMaxMinPistonCapping(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *BPSWMaxMinPistonCapping {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -73,25 +79,26 @@ func NewBPMaxMinPistonCapping(tasks []def.Task, ignoreWatts bool, schedTracePref
|
||||||
log.Fatal(err)
|
log.Fatal(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BPMaxMinPistonCapping{
|
s := &BPSWMaxMinPistonCapping{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
taskMonitor: make(map[string][]def.Task),
|
running: make(map[string]map[string]bool),
|
||||||
totalPower: make(map[string]float64),
|
taskMonitor: make(map[string][]def.Task),
|
||||||
RecordPCP: false,
|
totalPower: make(map[string]float64),
|
||||||
ticker: time.NewTicker(5 * time.Second),
|
RecordPCP: false,
|
||||||
isCapping: false,
|
ticker: time.NewTicker(5 * time.Second),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
isCapping: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinPistonCapping) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
func (s *BPSWMaxMinPistonCapping) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -125,8 +132,14 @@ func (s *BPMaxMinPistonCapping) newTask(offer *mesos.Offer, task def.Task) *meso
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -149,7 +162,7 @@ func (s *BPMaxMinPistonCapping) newTask(offer *mesos.Offer, task def.Task) *meso
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinPistonCapping) Disconnected(sched.SchedulerDriver) {
|
func (s *BPSWMaxMinPistonCapping) Disconnected(sched.SchedulerDriver) {
|
||||||
// Need to stop the capping process
|
// Need to stop the capping process
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
bpMaxMinPistonCappingMutex.Lock()
|
bpMaxMinPistonCappingMutex.Lock()
|
||||||
|
@ -167,7 +180,7 @@ var bpMaxMinPistonCappingCapValues = make(map[string]float64)
|
||||||
// Storing the previous cap value for each host so as to not repeatedly cap the nodes to the same value. (reduces overhead)
|
// Storing the previous cap value for each host so as to not repeatedly cap the nodes to the same value. (reduces overhead)
|
||||||
var bpMaxMinPistonCappingPreviousRoundedCapValues = make(map[string]int)
|
var bpMaxMinPistonCappingPreviousRoundedCapValues = make(map[string]int)
|
||||||
|
|
||||||
func (s *BPMaxMinPistonCapping) startCapping() {
|
func (s *BPSWMaxMinPistonCapping) startCapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -203,7 +216,7 @@ func (s *BPMaxMinPistonCapping) startCapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop the capping
|
// Stop the capping
|
||||||
func (s *BPMaxMinPistonCapping) stopCapping() {
|
func (s *BPSWMaxMinPistonCapping) stopCapping() {
|
||||||
if s.isCapping {
|
if s.isCapping {
|
||||||
log.Println("Stopping the capping.")
|
log.Println("Stopping the capping.")
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
|
@ -215,8 +228,10 @@ func (s *BPMaxMinPistonCapping) stopCapping() {
|
||||||
|
|
||||||
// Determine if the remaining sapce inside of the offer is enough for
|
// Determine if the remaining sapce inside of the offer is enough for
|
||||||
// the task we need to create. If it is, create a TaskInfo and return it.
|
// the task we need to create. If it is, create a TaskInfo and return it.
|
||||||
func (s *BPMaxMinPistonCapping) CheckFit(i int,
|
func (s *BPSWMaxMinPistonCapping) CheckFit(
|
||||||
|
i int,
|
||||||
task def.Task,
|
task def.Task,
|
||||||
|
wattsConsideration float64,
|
||||||
offer *mesos.Offer,
|
offer *mesos.Offer,
|
||||||
totalCPU *float64,
|
totalCPU *float64,
|
||||||
totalRAM *float64,
|
totalRAM *float64,
|
||||||
|
@ -224,7 +239,7 @@ func (s *BPMaxMinPistonCapping) CheckFit(i int,
|
||||||
partialLoad *float64) (bool, *mesos.TaskInfo) {
|
partialLoad *float64) (bool, *mesos.TaskInfo) {
|
||||||
|
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offer, *totalCPU, *totalRAM, *totalWatts, task) {
|
if s.takeOffer(offer, task) {
|
||||||
|
|
||||||
// Start piston capping if haven't started yet
|
// Start piston capping if haven't started yet
|
||||||
if !s.isCapping {
|
if !s.isCapping {
|
||||||
|
@ -232,7 +247,7 @@ func (s *BPMaxMinPistonCapping) CheckFit(i int,
|
||||||
s.startCapping()
|
s.startCapping()
|
||||||
}
|
}
|
||||||
|
|
||||||
*totalWatts += task.Watts
|
*totalWatts += wattsConsideration
|
||||||
*totalCPU += task.CPU
|
*totalCPU += task.CPU
|
||||||
*totalRAM += task.RAM
|
*totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
@ -243,7 +258,7 @@ func (s *BPMaxMinPistonCapping) CheckFit(i int,
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
fmt.Println("Inst: ", *task.Instances)
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
||||||
*task.Instances--
|
*task.Instances--
|
||||||
*partialLoad += ((task.Watts * constants.CapMargin) / s.totalPower[*offer.Hostname]) * 100
|
*partialLoad += ((wattsConsideration * constants.Tolerance) / s.totalPower[*offer.Hostname]) * 100
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
if *task.Instances <= 0 {
|
||||||
// All instances of task have been scheduled, remove it
|
// All instances of task have been scheduled, remove it
|
||||||
|
@ -261,7 +276,7 @@ func (s *BPMaxMinPistonCapping) CheckFit(i int,
|
||||||
return false, nil
|
return false, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
func (s *BPSWMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
log.Printf("Received %d resource offers", len(offers))
|
||||||
|
|
||||||
for _, offer := range offers {
|
for _, offer := range offers {
|
||||||
|
@ -292,13 +307,20 @@ func (s *BPMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
for i := len(s.tasks) - 1; i >= 0; i-- {
|
for i := len(s.tasks) - 1; i >= 0; i-- {
|
||||||
|
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts, &partialLoad)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts, &partialLoad)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -308,7 +330,13 @@ func (s *BPMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
}
|
}
|
||||||
|
|
||||||
// Pack the rest of the offer with the smallest tasks
|
// Pack the rest of the offer with the smallest tasks
|
||||||
for i, task := range s.tasks {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
@ -317,7 +345,8 @@ func (s *BPMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts, &partialLoad)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts, &partialLoad)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -348,7 +377,7 @@ func (s *BPMaxMinPistonCapping) ResourceOffers(driver sched.SchedulerDriver, off
|
||||||
}
|
}
|
||||||
|
|
||||||
// Remove finished task from the taskMonitor
|
// Remove finished task from the taskMonitor
|
||||||
func (s *BPMaxMinPistonCapping) deleteFromTaskMonitor(finishedTaskID string) (def.Task, string, error) {
|
func (s *BPSWMaxMinPistonCapping) deleteFromTaskMonitor(finishedTaskID string) (def.Task, string, error) {
|
||||||
hostOfFinishedTask := ""
|
hostOfFinishedTask := ""
|
||||||
indexOfFinishedTask := -1
|
indexOfFinishedTask := -1
|
||||||
found := false
|
found := false
|
||||||
|
@ -379,7 +408,7 @@ func (s *BPMaxMinPistonCapping) deleteFromTaskMonitor(finishedTaskID string) (de
|
||||||
return finishedTask, hostOfFinishedTask, nil
|
return finishedTask, hostOfFinishedTask, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinPistonCapping) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
func (s *BPSWMaxMinPistonCapping) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
if *status.State == mesos.TaskState_TASK_RUNNING {
|
||||||
|
@ -394,9 +423,16 @@ func (s *BPMaxMinPistonCapping) StatusUpdate(driver sched.SchedulerDriver, statu
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Need to determine the watts consideration for the finishedTask
|
||||||
|
var wattsConsideration float64
|
||||||
|
if s.classMapWatts {
|
||||||
|
wattsConsideration = finishedTask.ClassToWatts[hostToPowerClass(hostOfFinishedTask)]
|
||||||
|
} else {
|
||||||
|
wattsConsideration = finishedTask.Watts
|
||||||
|
}
|
||||||
// Need to update the cap values for host of the finishedTask
|
// Need to update the cap values for host of the finishedTask
|
||||||
bpMaxMinPistonCappingMutex.Lock()
|
bpMaxMinPistonCappingMutex.Lock()
|
||||||
bpMaxMinPistonCappingCapValues[hostOfFinishedTask] -= ((finishedTask.Watts * constants.CapMargin) / s.totalPower[hostOfFinishedTask]) * 100
|
bpMaxMinPistonCappingCapValues[hostOfFinishedTask] -= ((wattsConsideration * constants.Tolerance) / s.totalPower[hostOfFinishedTask]) * 100
|
||||||
// Checking to see if the cap value has become 0, in which case we uncap the host.
|
// Checking to see if the cap value has become 0, in which case we uncap the host.
|
||||||
if int(math.Floor(bpMaxMinPistonCappingCapValues[hostOfFinishedTask]+0.5)) == 0 {
|
if int(math.Floor(bpMaxMinPistonCappingCapValues[hostOfFinishedTask]+0.5)) == 0 {
|
||||||
bpMaxMinPistonCappingCapValues[hostOfFinishedTask] = 100
|
bpMaxMinPistonCappingCapValues[hostOfFinishedTask] = 100
|
|
@ -21,35 +21,39 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *BPMaxMinProacCC) takeOffer(offer *mesos.Offer, totalCPU, totalRAM, totalWatts float64, task def.Task) bool {
|
func (s *BPSWMaxMinProacCC) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
// Does the task fit
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (*totalWatts + task.Watts))) &&
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
(offerCPU >= (*totalCPU + task.CPU)) &&
|
if err != nil {
|
||||||
(offerRAM >= (*totalRAM + task.RAM)) {
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || (watts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
type BPMaxMinProacCC struct {
|
type BPSWMaxMinProacCC struct {
|
||||||
base // Type embedding to inherit common functions
|
base // Type embedding to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
taskMonitor map[string][]def.Task
|
taskMonitor map[string][]def.Task
|
||||||
availablePower map[string]float64
|
availablePower map[string]float64
|
||||||
totalPower map[string]float64
|
totalPower map[string]float64
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
capper *powCap.ClusterwideCapper
|
classMapWatts bool
|
||||||
ticker *time.Ticker
|
capper *powCap.ClusterwideCapper
|
||||||
recapTicker *time.Ticker
|
ticker *time.Ticker
|
||||||
isCapping bool // indicate whether we are currently performing cluster-wide capping.
|
recapTicker *time.Ticker
|
||||||
isRecapping bool // indicate whether we are currently performing cluster-wide recapping.
|
isCapping bool // indicate whether we are currently performing cluster-wide capping.
|
||||||
|
isRecapping bool // indicate whether we are currently performing cluster-wide recapping.
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -69,7 +73,7 @@ type BPMaxMinProacCC struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewBPMaxMinProacCC(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *BPMaxMinProacCC {
|
func NewBPSWMaxMinProacCC(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *BPSWMaxMinProacCC {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -77,23 +81,24 @@ func NewBPMaxMinProacCC(tasks []def.Task, ignoreWatts bool, schedTracePrefix str
|
||||||
log.Fatal(err)
|
log.Fatal(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &BPMaxMinProacCC{
|
s := &BPSWMaxMinProacCC{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
taskMonitor: make(map[string][]def.Task),
|
running: make(map[string]map[string]bool),
|
||||||
availablePower: make(map[string]float64),
|
taskMonitor: make(map[string][]def.Task),
|
||||||
totalPower: make(map[string]float64),
|
availablePower: make(map[string]float64),
|
||||||
RecordPCP: false,
|
totalPower: make(map[string]float64),
|
||||||
capper: powCap.GetClusterwideCapperInstance(),
|
RecordPCP: false,
|
||||||
ticker: time.NewTicker(10 * time.Second),
|
capper: powCap.GetClusterwideCapperInstance(),
|
||||||
recapTicker: time.NewTicker(20 * time.Second),
|
ticker: time.NewTicker(10 * time.Second),
|
||||||
isCapping: false,
|
recapTicker: time.NewTicker(20 * time.Second),
|
||||||
isRecapping: false,
|
isCapping: false,
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
isRecapping: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -101,7 +106,7 @@ func NewBPMaxMinProacCC(tasks []def.Task, ignoreWatts bool, schedTracePrefix str
|
||||||
// mutex
|
// mutex
|
||||||
var bpMaxMinProacCCMutex sync.Mutex
|
var bpMaxMinProacCCMutex sync.Mutex
|
||||||
|
|
||||||
func (s *BPMaxMinProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
func (s *BPSWMaxMinProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -132,8 +137,14 @@ func (s *BPMaxMinProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.Task
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -159,7 +170,7 @@ func (s *BPMaxMinProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.Task
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
// go routine to cap the entire cluster in regular intervals of time.
|
||||||
var bpMaxMinProacCCCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
var bpMaxMinProacCCCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
||||||
var bpMaxMinProacCCNewCapValue = 0.0 // newly computed cap value
|
var bpMaxMinProacCCNewCapValue = 0.0 // newly computed cap value
|
||||||
func (s *BPMaxMinProacCC) startCapping() {
|
func (s *BPSWMaxMinProacCC) startCapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -190,7 +201,7 @@ func (s *BPMaxMinProacCC) startCapping() {
|
||||||
|
|
||||||
// go routine to recap the entire cluster in regular intervals of time.
|
// go routine to recap the entire cluster in regular intervals of time.
|
||||||
var bpMaxMinProacCCRecapValue = 0.0 // The cluster-wide cap value when recapping.
|
var bpMaxMinProacCCRecapValue = 0.0 // The cluster-wide cap value when recapping.
|
||||||
func (s *BPMaxMinProacCC) startRecapping() {
|
func (s *BPSWMaxMinProacCC) startRecapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -216,7 +227,7 @@ func (s *BPMaxMinProacCC) startRecapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop cluster-wide capping
|
// Stop cluster-wide capping
|
||||||
func (s *BPMaxMinProacCC) stopCapping() {
|
func (s *BPSWMaxMinProacCC) stopCapping() {
|
||||||
if s.isCapping {
|
if s.isCapping {
|
||||||
log.Println("Stopping the cluster-wide capping.")
|
log.Println("Stopping the cluster-wide capping.")
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
|
@ -228,7 +239,7 @@ func (s *BPMaxMinProacCC) stopCapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop the cluster-wide recapping
|
// Stop the cluster-wide recapping
|
||||||
func (s *BPMaxMinProacCC) stopRecapping() {
|
func (s *BPSWMaxMinProacCC) stopRecapping() {
|
||||||
// If not capping, then definitely recapping.
|
// If not capping, then definitely recapping.
|
||||||
if !s.isCapping && s.isRecapping {
|
if !s.isCapping && s.isRecapping {
|
||||||
log.Println("Stopping the cluster-wide re-capping.")
|
log.Println("Stopping the cluster-wide re-capping.")
|
||||||
|
@ -241,15 +252,17 @@ func (s *BPMaxMinProacCC) stopRecapping() {
|
||||||
|
|
||||||
// Determine if the remaining space inside of the offer is enough for
|
// Determine if the remaining space inside of the offer is enough for
|
||||||
// the task we need to create. If it is, create TaskInfo and return it.
|
// the task we need to create. If it is, create TaskInfo and return it.
|
||||||
func (s *BPMaxMinProacCC) CheckFit(i int,
|
func (s *BPSWMaxMinProacCC) CheckFit(
|
||||||
|
i int,
|
||||||
task def.Task,
|
task def.Task,
|
||||||
|
wattsConsideration float64,
|
||||||
offer *mesos.Offer,
|
offer *mesos.Offer,
|
||||||
totalCPU *float64,
|
totalCPU *float64,
|
||||||
totalRAM *float64,
|
totalRAM *float64,
|
||||||
totalWatts *float64) (bool, *mesos.TaskInfo) {
|
totalWatts *float64) (bool, *mesos.TaskInfo) {
|
||||||
|
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
if s.takeOffer(offer, *totalCPU, *totalRAM, *totalWatts, task) {
|
if s.takeOffer(offer, task) {
|
||||||
|
|
||||||
// Capping the cluster if haven't yet started
|
// Capping the cluster if haven't yet started
|
||||||
if !s.isCapping {
|
if !s.isCapping {
|
||||||
|
@ -269,7 +282,7 @@ func (s *BPMaxMinProacCC) CheckFit(i int,
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
*totalWatts += task.Watts
|
*totalWatts += wattsConsideration
|
||||||
*totalCPU += task.CPU
|
*totalCPU += task.CPU
|
||||||
*totalRAM += task.RAM
|
*totalRAM += task.RAM
|
||||||
log.Println("Co-Located with: ")
|
log.Println("Co-Located with: ")
|
||||||
|
@ -301,7 +314,7 @@ func (s *BPMaxMinProacCC) CheckFit(i int,
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
func (s *BPSWMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
log.Printf("Received %d resource offers", len(offers))
|
||||||
|
|
||||||
// retrieving the available power for all the hosts in the offers.
|
// retrieving the available power for all the hosts in the offers.
|
||||||
|
@ -343,13 +356,19 @@ func (s *BPMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []
|
||||||
for i := len(s.tasks) - 1; i >= 0; i-- {
|
for i := len(s.tasks) - 1; i >= 0; i-- {
|
||||||
|
|
||||||
task := s.tasks[i]
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -359,7 +378,13 @@ func (s *BPMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []
|
||||||
}
|
}
|
||||||
|
|
||||||
// Pack the rest of the offer with the smallest tasks
|
// Pack the rest of the offer with the smallest tasks
|
||||||
for i, task := range s.tasks {
|
for i := 0; i < len(s.tasks); i++ {
|
||||||
|
task := s.tasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
// Don't take offer if it doesn't match our task's host requirement
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
||||||
|
@ -368,7 +393,8 @@ func (s *BPMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
// TODO: Fix this so index doesn't need to be passed
|
// TODO: Fix this so index doesn't need to be passed
|
||||||
taken, taskToSchedule := s.CheckFit(i, task, offer, &totalCPU, &totalRAM, &totalWatts)
|
taken, taskToSchedule := s.CheckFit(i, task, wattsConsideration, offer,
|
||||||
|
&totalCPU, &totalRAM, &totalWatts)
|
||||||
|
|
||||||
if taken {
|
if taken {
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
|
@ -394,7 +420,7 @@ func (s *BPMaxMinProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *BPMaxMinProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
func (s *BPSWMaxMinProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
@ -21,7 +21,12 @@ func (s *FirstFit) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
|
||||||
if cpus >= task.CPU && mem >= task.RAM && (s.ignoreWatts || watts >= task.Watts) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || watts >= wattsConsideration) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -30,13 +35,14 @@ func (s *FirstFit) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type FirstFit struct {
|
type FirstFit struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -56,7 +62,7 @@ type FirstFit struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewFirstFit(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFit {
|
func NewFirstFit(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *FirstFit {
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
@ -64,14 +70,15 @@ func NewFirstFit(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *F
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &FirstFit{
|
s := &FirstFit{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -99,8 +106,14 @@ func (s *FirstFit) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
|
|
@ -20,32 +20,38 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (s *ProactiveClusterwideCapFCFS) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
func (s *FirstFitProacCC) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offer_cpu, offer_mem, offer_watts := offerUtils.OfferAgg(offer)
|
offer_cpu, offer_mem, offer_watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
if offer_cpu >= task.CPU && offer_mem >= task.RAM && (s.ignoreWatts || (offer_watts >= task.Watts)) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if offer_cpu >= task.CPU && offer_mem >= task.RAM && (!s.wattsAsAResource || (offer_watts >= wattsConsideration)) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface.
|
// electronScheduler implements the Scheduler interface.
|
||||||
type ProactiveClusterwideCapFCFS struct {
|
type FirstFitProacCC struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
taskMonitor map[string][]def.Task // store tasks that are currently running.
|
taskMonitor map[string][]def.Task // store tasks that are currently running.
|
||||||
availablePower map[string]float64 // available power for each node in the cluster.
|
availablePower map[string]float64 // available power for each node in the cluster.
|
||||||
totalPower map[string]float64 // total power for each node in the cluster.
|
totalPower map[string]float64 // total power for each node in the cluster.
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
capper *powCap.ClusterwideCapper
|
classMapWatts bool
|
||||||
ticker *time.Ticker
|
capper *powCap.ClusterwideCapper
|
||||||
recapTicker *time.Ticker
|
ticker *time.Ticker
|
||||||
isCapping bool // indicate whether we are currently performing cluster wide capping.
|
recapTicker *time.Ticker
|
||||||
isRecapping bool // indicate whether we are currently performing cluster wide re-capping.
|
isCapping bool // indicate whether we are currently performing cluster wide capping.
|
||||||
|
isRecapping bool // indicate whether we are currently performing cluster wide re-capping.
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule the new task.
|
// about to schedule the new task.
|
||||||
|
@ -66,30 +72,32 @@ type ProactiveClusterwideCapFCFS struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler.
|
// New electron scheduler.
|
||||||
func NewProactiveClusterwideCapFCFS(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *ProactiveClusterwideCapFCFS {
|
func NewFirstFitProacCC(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *FirstFitProacCC {
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
log.Fatal(err)
|
log.Fatal(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &ProactiveClusterwideCapFCFS{
|
s := &FirstFitProacCC{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
taskMonitor: make(map[string][]def.Task),
|
running: make(map[string]map[string]bool),
|
||||||
availablePower: make(map[string]float64),
|
taskMonitor: make(map[string][]def.Task),
|
||||||
totalPower: make(map[string]float64),
|
availablePower: make(map[string]float64),
|
||||||
RecordPCP: false,
|
totalPower: make(map[string]float64),
|
||||||
capper: powCap.GetClusterwideCapperInstance(),
|
RecordPCP: false,
|
||||||
ticker: time.NewTicker(10 * time.Second),
|
capper: powCap.GetClusterwideCapperInstance(),
|
||||||
recapTicker: time.NewTicker(20 * time.Second),
|
ticker: time.NewTicker(10 * time.Second),
|
||||||
isCapping: false,
|
recapTicker: time.NewTicker(20 * time.Second),
|
||||||
isRecapping: false,
|
isCapping: false,
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
isRecapping: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -97,7 +105,7 @@ func NewProactiveClusterwideCapFCFS(tasks []def.Task, ignoreWatts bool, schedTra
|
||||||
// mutex
|
// mutex
|
||||||
var fcfsMutex sync.Mutex
|
var fcfsMutex sync.Mutex
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapFCFS) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
func (s *FirstFitProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -128,8 +136,14 @@ func (s *ProactiveClusterwideCapFCFS) newTask(offer *mesos.Offer, task def.Task)
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -152,7 +166,7 @@ func (s *ProactiveClusterwideCapFCFS) newTask(offer *mesos.Offer, task def.Task)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapFCFS) Disconnected(sched.SchedulerDriver) {
|
func (s *FirstFitProacCC) Disconnected(sched.SchedulerDriver) {
|
||||||
// Need to stop the capping process.
|
// Need to stop the capping process.
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
s.recapTicker.Stop()
|
s.recapTicker.Stop()
|
||||||
|
@ -164,7 +178,7 @@ func (s *ProactiveClusterwideCapFCFS) Disconnected(sched.SchedulerDriver) {
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
// go routine to cap the entire cluster in regular intervals of time.
|
||||||
var fcfsCurrentCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
var fcfsCurrentCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
||||||
func (s *ProactiveClusterwideCapFCFS) startCapping() {
|
func (s *FirstFitProacCC) startCapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -188,7 +202,7 @@ func (s *ProactiveClusterwideCapFCFS) startCapping() {
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
// go routine to cap the entire cluster in regular intervals of time.
|
||||||
var fcfsRecapValue = 0.0 // The cluster wide cap value when recapping.
|
var fcfsRecapValue = 0.0 // The cluster wide cap value when recapping.
|
||||||
func (s *ProactiveClusterwideCapFCFS) startRecapping() {
|
func (s *FirstFitProacCC) startRecapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -213,7 +227,7 @@ func (s *ProactiveClusterwideCapFCFS) startRecapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop cluster wide capping
|
// Stop cluster wide capping
|
||||||
func (s *ProactiveClusterwideCapFCFS) stopCapping() {
|
func (s *FirstFitProacCC) stopCapping() {
|
||||||
if s.isCapping {
|
if s.isCapping {
|
||||||
log.Println("Stopping the cluster wide capping.")
|
log.Println("Stopping the cluster wide capping.")
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
|
@ -225,7 +239,7 @@ func (s *ProactiveClusterwideCapFCFS) stopCapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop cluster wide Recapping
|
// Stop cluster wide Recapping
|
||||||
func (s *ProactiveClusterwideCapFCFS) stopRecapping() {
|
func (s *FirstFitProacCC) stopRecapping() {
|
||||||
// If not capping, then definitely recapping.
|
// If not capping, then definitely recapping.
|
||||||
if !s.isCapping && s.isRecapping {
|
if !s.isCapping && s.isRecapping {
|
||||||
log.Println("Stopping the cluster wide re-capping.")
|
log.Println("Stopping the cluster wide re-capping.")
|
||||||
|
@ -236,7 +250,7 @@ func (s *ProactiveClusterwideCapFCFS) stopRecapping() {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapFCFS) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
func (s *FirstFitProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
log.Printf("Received %d resource offers", len(offers))
|
||||||
|
|
||||||
// retrieving the available power for all the hosts in the offers.
|
// retrieving the available power for all the hosts in the offers.
|
||||||
|
@ -300,7 +314,7 @@ func (s *ProactiveClusterwideCapFCFS) ResourceOffers(driver sched.SchedulerDrive
|
||||||
fcfsCurrentCapValue = tempCap
|
fcfsCurrentCapValue = tempCap
|
||||||
fcfsMutex.Unlock()
|
fcfsMutex.Unlock()
|
||||||
} else {
|
} else {
|
||||||
log.Printf("Failed to determine new cluster wide cap: ")
|
log.Println("Failed to determine new cluster wide cap: ")
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
log.Printf("Starting on [%s]\n", offer.GetHostname())
|
log.Printf("Starting on [%s]\n", offer.GetHostname())
|
||||||
|
@ -340,7 +354,7 @@ func (s *ProactiveClusterwideCapFCFS) ResourceOffers(driver sched.SchedulerDrive
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapFCFS) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
func (s *FirstFitProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
||||||
log.Printf("Received task status [%s] for task [%s]\n", NameFor(status.State), *status.TaskId.Value)
|
log.Printf("Received task status [%s] for task [%s]\n", NameFor(status.State), *status.TaskId.Value)
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
@ -22,7 +22,12 @@ func (s *FirstFitSortedOffers) takeOffer(offer *mesos.Offer, task def.Task) bool
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
|
||||||
if cpus >= task.CPU && mem >= task.RAM && (s.ignoreWatts || watts >= task.Watts) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || watts >= wattsConsideration) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -31,13 +36,14 @@ func (s *FirstFitSortedOffers) takeOffer(offer *mesos.Offer, task def.Task) bool
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type FirstFitSortedOffers struct {
|
type FirstFitSortedOffers struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -57,7 +63,7 @@ type FirstFitSortedOffers struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewFirstFitSortedOffers(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitSortedOffers {
|
func NewFirstFitSortedOffers(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *FirstFitSortedOffers {
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
@ -65,14 +71,15 @@ func NewFirstFitSortedOffers(tasks []def.Task, ignoreWatts bool, schedTracePrefi
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &FirstFitSortedOffers{
|
s := &FirstFitSortedOffers{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -100,8 +107,14 @@ func (s *FirstFitSortedOffers) newTask(offer *mesos.Offer, task def.Task) *mesos
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
|
|
@ -1,209 +0,0 @@
|
||||||
package schedulers
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/mesosUtils"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
"fmt"
|
|
||||||
"github.com/golang/protobuf/proto"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"github.com/mesos/mesos-go/mesosutil"
|
|
||||||
sched "github.com/mesos/mesos-go/scheduler"
|
|
||||||
"log"
|
|
||||||
"os"
|
|
||||||
"sort"
|
|
||||||
"time"
|
|
||||||
)
|
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
|
||||||
func (s *FirstFitSortedWattsClassMapWatts) takeOffer(offer *mesos.Offer, powerClass string, task def.Task) bool {
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
|
||||||
// Decision to take the offer or not
|
|
||||||
if (s.ignoreWatts || (offerWatts >= task.ClassToWatts[powerClass])) &&
|
|
||||||
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
// electron scheduler implements the Scheduler interface
|
|
||||||
type FirstFitSortedWattsClassMapWatts struct {
|
|
||||||
base // Type embedded to inherit common features.
|
|
||||||
tasksCreated int
|
|
||||||
tasksRunning int
|
|
||||||
tasks []def.Task
|
|
||||||
metrics map[string]def.Metric
|
|
||||||
running map[string]map[string]bool
|
|
||||||
ignoreWatts bool
|
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
|
||||||
// about to schedule a new task
|
|
||||||
RecordPCP bool
|
|
||||||
|
|
||||||
// This channel is closed when the program receives an interrupt,
|
|
||||||
// signalling that the program should shut down.
|
|
||||||
Shutdown chan struct{}
|
|
||||||
// This channel is closed after shutdown is closed, and only when all
|
|
||||||
// outstanding tasks have been cleaned up
|
|
||||||
Done chan struct{}
|
|
||||||
|
|
||||||
// Controls when to shutdown pcp logging
|
|
||||||
PCPLog chan struct{}
|
|
||||||
|
|
||||||
schedTrace *log.Logger
|
|
||||||
}
|
|
||||||
|
|
||||||
// New electorn scheduler
|
|
||||||
func NewFirstFitSortedWattsClassMapWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitSortedWattsClassMapWatts {
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatal(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s := &FirstFitSortedWattsClassMapWatts{
|
|
||||||
tasks: tasks,
|
|
||||||
ignoreWatts: ignoreWatts,
|
|
||||||
Shutdown: make(chan struct{}),
|
|
||||||
Done: make(chan struct{}),
|
|
||||||
PCPLog: make(chan struct{}),
|
|
||||||
running: make(map[string]map[string]bool),
|
|
||||||
RecordPCP: false,
|
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
|
||||||
}
|
|
||||||
return s
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWatts) newTask(offer *mesos.Offer, task def.Task, powerClass string) *mesos.TaskInfo {
|
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
|
||||||
s.tasksCreated++
|
|
||||||
|
|
||||||
if !s.RecordPCP {
|
|
||||||
// Turn on logging
|
|
||||||
s.RecordPCP = true
|
|
||||||
time.Sleep(1 * time.Second) // Make sure we're recording by the time the first task starts
|
|
||||||
}
|
|
||||||
|
|
||||||
// If this is our first time running into this Agent
|
|
||||||
if _, ok := s.running[offer.GetSlaveId().GoString()]; !ok {
|
|
||||||
s.running[offer.GetSlaveId().GoString()] = make(map[string]bool)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Add task to list of tasks running on node
|
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
|
||||||
|
|
||||||
resources := []*mesos.Resource{
|
|
||||||
mesosutil.NewScalarResource("cpus", task.CPU),
|
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
|
||||||
}
|
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[powerClass]))
|
|
||||||
}
|
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
|
||||||
Name: proto.String(taskName),
|
|
||||||
TaskId: &mesos.TaskID{
|
|
||||||
Value: proto.String("electron-" + taskName),
|
|
||||||
},
|
|
||||||
SlaveId: offer.SlaveId,
|
|
||||||
Resources: resources,
|
|
||||||
Command: &mesos.CommandInfo{
|
|
||||||
Value: proto.String(task.CMD),
|
|
||||||
},
|
|
||||||
Container: &mesos.ContainerInfo{
|
|
||||||
Type: mesos.ContainerInfo_DOCKER.Enum(),
|
|
||||||
Docker: &mesos.ContainerInfo_DockerInfo{
|
|
||||||
Image: proto.String(task.Image),
|
|
||||||
Network: mesos.ContainerInfo_DockerInfo_BRIDGE.Enum(), // Run everything isolated
|
|
||||||
},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWatts) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
|
||||||
|
|
||||||
for _, offer := range offers {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
log.Println("Done scheduling tasks: declining offer on [", offer.GetHostname(), "]")
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.LongFilter)
|
|
||||||
|
|
||||||
log.Println("Number of tasks still running: ", s.tasksRunning)
|
|
||||||
continue
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
|
|
||||||
// First fit strategy
|
|
||||||
offerTaken := false
|
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
|
||||||
task := s.tasks[i]
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
// retrieving the powerClass from the offer
|
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
|
|
||||||
// Decision to take the offer or not
|
|
||||||
if s.takeOffer(offer, powerClass, task) {
|
|
||||||
fmt.Println("Watts being used: ", task.ClassToWatts[powerClass])
|
|
||||||
log.Println("Co-Located with: ")
|
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
|
||||||
|
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
|
||||||
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, []*mesos.TaskInfo{taskToSchedule}, mesosUtils.DefaultFilter)
|
|
||||||
|
|
||||||
offerTaken = true
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
|
||||||
*task.Instances--
|
|
||||||
if *task.Instances <= 0 {
|
|
||||||
// All instances of task have been scheduled, remove it
|
|
||||||
s.tasks = append(s.tasks[:i], s.tasks[i+1:]...)
|
|
||||||
|
|
||||||
if len(s.tasks) == 0 {
|
|
||||||
log.Println("Done scheduling all tasks")
|
|
||||||
close(s.Shutdown)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
break // Offer taken, move on
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// If there was no match for the task
|
|
||||||
if !offerTaken {
|
|
||||||
fmt.Println("There is not enough resources to launch a task:")
|
|
||||||
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
log.Printf("<CPU: %f, RAM: %f, Watts: %f>\n", cpus, mem, watts)
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.DefaultFilter)
|
|
||||||
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWatts) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
||||||
s.tasksRunning++
|
|
||||||
} else if IsTerminal(status.State) {
|
|
||||||
delete(s.running[status.GetSlaveId().GoString()], *status.TaskId.Value)
|
|
||||||
s.tasksRunning--
|
|
||||||
if s.tasksRunning == 0 {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
close(s.Done)
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("DONE: Task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
}
|
|
|
@ -1,392 +0,0 @@
|
||||||
package schedulers
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bitbucket.org/sunybingcloud/electron/constants"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
powCap "bitbucket.org/sunybingcloud/electron/powerCapping"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/rapl"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/mesosUtils"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
"fmt"
|
|
||||||
"github.com/golang/protobuf/proto"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"github.com/mesos/mesos-go/mesosutil"
|
|
||||||
sched "github.com/mesos/mesos-go/scheduler"
|
|
||||||
"log"
|
|
||||||
"math"
|
|
||||||
"os"
|
|
||||||
"sort"
|
|
||||||
"sync"
|
|
||||||
"time"
|
|
||||||
)
|
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) takeOffer(offer *mesos.Offer, powerClass string, task def.Task) bool {
|
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
|
||||||
// Decision to take the offer or not
|
|
||||||
if (s.ignoreWatts || (offerWatts >= task.ClassToWatts[powerClass])) &&
|
|
||||||
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
// electron scheduler implements the Scheduler interface
|
|
||||||
type FirstFitSortedWattsClassMapWattsProacCC struct {
|
|
||||||
base // Type embedded to inherit common features.
|
|
||||||
tasksCreated int
|
|
||||||
tasksRunning int
|
|
||||||
tasks []def.Task
|
|
||||||
metrics map[string]def.Metric
|
|
||||||
running map[string]map[string]bool
|
|
||||||
taskMonitor map[string][]def.Task
|
|
||||||
availablePower map[string]float64
|
|
||||||
totalPower map[string]float64
|
|
||||||
ignoreWatts bool
|
|
||||||
capper *powCap.ClusterwideCapper
|
|
||||||
ticker *time.Ticker
|
|
||||||
recapTicker *time.Ticker
|
|
||||||
isCapping bool // indicate whether we are currently performing cluster-wide capping.
|
|
||||||
isRecapping bool // indicate whether we are currently performing cluster-wide recapping.
|
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
|
||||||
// about to schedule a new task
|
|
||||||
RecordPCP bool
|
|
||||||
|
|
||||||
// This channel is closed when the program receives an interrupt,
|
|
||||||
// signalling that the program should shut down.
|
|
||||||
Shutdown chan struct{}
|
|
||||||
// This channel is closed after shutdown is closed, and only when all
|
|
||||||
// outstanding tasks have been cleaned up
|
|
||||||
Done chan struct{}
|
|
||||||
|
|
||||||
// Controls when to shutdown pcp logging
|
|
||||||
PCPLog chan struct{}
|
|
||||||
|
|
||||||
schedTrace *log.Logger
|
|
||||||
}
|
|
||||||
|
|
||||||
// New electron scheduler
|
|
||||||
func NewFirstFitSortedWattsClassMapWattsProacCC(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitSortedWattsClassMapWattsProacCC {
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatal(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s := &FirstFitSortedWattsClassMapWattsProacCC{
|
|
||||||
tasks: tasks,
|
|
||||||
ignoreWatts: ignoreWatts,
|
|
||||||
Shutdown: make(chan struct{}),
|
|
||||||
Done: make(chan struct{}),
|
|
||||||
PCPLog: make(chan struct{}),
|
|
||||||
running: make(map[string]map[string]bool),
|
|
||||||
taskMonitor: make(map[string][]def.Task),
|
|
||||||
availablePower: make(map[string]float64),
|
|
||||||
totalPower: make(map[string]float64),
|
|
||||||
RecordPCP: false,
|
|
||||||
capper: powCap.GetClusterwideCapperInstance(),
|
|
||||||
ticker: time.NewTicker(10 * time.Second),
|
|
||||||
recapTicker: time.NewTicker(20 * time.Second),
|
|
||||||
isCapping: false,
|
|
||||||
isRecapping: false,
|
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
|
||||||
}
|
|
||||||
return s
|
|
||||||
}
|
|
||||||
|
|
||||||
// mutex
|
|
||||||
var ffswClassMapWattsProacCCMutex sync.Mutex
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) newTask(offer *mesos.Offer, task def.Task, powerClass string) *mesos.TaskInfo {
|
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
|
||||||
s.tasksCreated++
|
|
||||||
|
|
||||||
if !s.RecordPCP {
|
|
||||||
// Turn on logging.
|
|
||||||
s.RecordPCP = true
|
|
||||||
time.Sleep(1 * time.Second) // Make sure we're recording by the time the first task starts
|
|
||||||
}
|
|
||||||
|
|
||||||
// If this is our first time running into this Agent
|
|
||||||
if _, ok := s.running[offer.GetSlaveId().GoString()]; !ok {
|
|
||||||
s.running[offer.GetSlaveId().GoString()] = make(map[string]bool)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Setting the task ID to the task. This is done so that we can consider each task to be different,
|
|
||||||
// even though they have the same parameters.
|
|
||||||
task.SetTaskID(*proto.String("electron-" + taskName))
|
|
||||||
// Add task to the list of tasks running on the node.
|
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
|
||||||
if len(s.taskMonitor[*offer.Hostname]) == 0 {
|
|
||||||
s.taskMonitor[*offer.Hostname] = []def.Task{task}
|
|
||||||
} else {
|
|
||||||
s.taskMonitor[*offer.Hostname] = append(s.taskMonitor[*offer.Hostname], task)
|
|
||||||
}
|
|
||||||
|
|
||||||
resources := []*mesos.Resource{
|
|
||||||
mesosutil.NewScalarResource("cpus", task.CPU),
|
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
|
||||||
}
|
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[powerClass]))
|
|
||||||
}
|
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
|
||||||
Name: proto.String(taskName),
|
|
||||||
TaskId: &mesos.TaskID{
|
|
||||||
Value: proto.String("electron-" + taskName),
|
|
||||||
},
|
|
||||||
SlaveId: offer.SlaveId,
|
|
||||||
Resources: resources,
|
|
||||||
Command: &mesos.CommandInfo{
|
|
||||||
Value: proto.String(task.CMD),
|
|
||||||
},
|
|
||||||
Container: &mesos.ContainerInfo{
|
|
||||||
Type: mesos.ContainerInfo_DOCKER.Enum(),
|
|
||||||
Docker: &mesos.ContainerInfo_DockerInfo{
|
|
||||||
Image: proto.String(task.Image),
|
|
||||||
Network: mesos.ContainerInfo_DockerInfo_BRIDGE.Enum(), // Run everything isolated
|
|
||||||
},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) Disconnected(sched.SchedulerDriver) {
|
|
||||||
// Need to stop the capping process
|
|
||||||
s.ticker.Stop()
|
|
||||||
s.recapTicker.Stop()
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
log.Println("Framework disconnected with master")
|
|
||||||
}
|
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time
|
|
||||||
var ffswClassMapWattsProacCCCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
|
||||||
var ffswClassMapWattsProacCCNewCapValue = 0.0 // newly computed cap value
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) startCapping() {
|
|
||||||
go func() {
|
|
||||||
for {
|
|
||||||
select {
|
|
||||||
case <-s.ticker.C:
|
|
||||||
// Need to cap the cluster only if new cap value different from the old cap value.
|
|
||||||
// This way we don't unnecessarily cap the cluster.
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
if s.isCapping {
|
|
||||||
if int(math.Floor(ffswClassMapWattsProacCCNewCapValue+0.5)) != int(math.Floor(ffswClassMapWattsProacCCCapValue+0.5)) {
|
|
||||||
// updating cap value
|
|
||||||
ffswClassMapWattsProacCCCapValue = ffswClassMapWattsProacCCNewCapValue
|
|
||||||
if ffswClassMapWattsProacCCCapValue > 0.0 {
|
|
||||||
for _, host := range constants.Hosts {
|
|
||||||
// Rounding cap value to the nearest int
|
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(ffswClassMapWattsProacCCCapValue+0.5))); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("Capped the cluster to %d", int(math.Floor(ffswClassMapWattsProacCCCapValue+0.5)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
|
||||||
|
|
||||||
// go routine to recap the entire cluster in regular intervals of time.
|
|
||||||
var ffswClassMapWattsProacCCRecapValue = 0.0 // The cluster-wide cap value when recapping.
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) startRecapping() {
|
|
||||||
go func() {
|
|
||||||
for {
|
|
||||||
select {
|
|
||||||
case <-s.recapTicker.C:
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
// If stopped performing cluster wide capping, then we need to recap
|
|
||||||
if s.isRecapping && ffswClassMapWattsProacCCRecapValue > 0.0 {
|
|
||||||
for _, host := range constants.Hosts {
|
|
||||||
// Rounding the cap value to the nearest int
|
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(ffswClassMapWattsProacCCRecapValue+0.5))); err != nil {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("Recapping the cluster to %d", int(math.Floor(ffswClassMapWattsProacCCRecapValue+0.5)))
|
|
||||||
}
|
|
||||||
// Setting recapping to false
|
|
||||||
s.isRecapping = false
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stop the cluster wide capping
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) stopCapping() {
|
|
||||||
if s.isCapping {
|
|
||||||
log.Println("Stopping the cluster-wide capping.")
|
|
||||||
s.ticker.Stop()
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = false
|
|
||||||
s.isRecapping = true
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stop the cluster wide recapping
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) stopRecapping() {
|
|
||||||
// If not capping, then definitely recapping.
|
|
||||||
if !s.isCapping && s.isRecapping {
|
|
||||||
log.Println("Stopping the cluster-wide re-capping.")
|
|
||||||
s.recapTicker.Stop()
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = false
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
|
||||||
|
|
||||||
// retrieving the available power for all the hosts in the offers.
|
|
||||||
for _, offer := range offers {
|
|
||||||
_, _, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
s.availablePower[*offer.Hostname] = offerWatts
|
|
||||||
// setting total power if the first time
|
|
||||||
if _, ok := s.totalPower[*offer.Hostname]; !ok {
|
|
||||||
s.totalPower[*offer.Hostname] = offerWatts
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for host, tpower := range s.totalPower {
|
|
||||||
log.Printf("TotalPower[%s] = %f", host, tpower)
|
|
||||||
}
|
|
||||||
|
|
||||||
for _, offer := range offers {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
log.Println("Done scheduling tasks: declining offer on [", offer.GetHostname(), "]")
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.LongFilter)
|
|
||||||
|
|
||||||
log.Println("Number of tasks still running: ", s.tasksRunning)
|
|
||||||
continue
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
|
|
||||||
// First fit strategy
|
|
||||||
offerTaken := false
|
|
||||||
for i := 0; i < len(s.tasks); i++ {
|
|
||||||
task := s.tasks[i]
|
|
||||||
// Don't take offer if it doesn't match our task's host requirement
|
|
||||||
if offerUtils.HostMismatch(*offer.Hostname, task.Host) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
// retrieving the powerClass for the offer
|
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
|
|
||||||
// Decision to take the offer or not
|
|
||||||
if s.takeOffer(offer, powerClass, task) {
|
|
||||||
|
|
||||||
// Capping the cluster if haven't yet started
|
|
||||||
if !s.isCapping {
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isCapping = true
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
s.startCapping()
|
|
||||||
}
|
|
||||||
|
|
||||||
fmt.Println("Watts being used: ", task.ClassToWatts[powerClass])
|
|
||||||
tempCap, err := s.capper.FCFSDeterminedCap(s.totalPower, &task)
|
|
||||||
if err == nil {
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
ffswClassMapWattsProacCCNewCapValue = tempCap
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
} else {
|
|
||||||
log.Println("Failed to determine new cluster-wide cap: ")
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
log.Println("Co-Located with: ")
|
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
|
||||||
|
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
|
||||||
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, []*mesos.TaskInfo{taskToSchedule}, mesosUtils.DefaultFilter)
|
|
||||||
|
|
||||||
offerTaken = true
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
|
||||||
*task.Instances--
|
|
||||||
if *task.Instances <= 0 {
|
|
||||||
// All instances of task have been scheduled, remove it
|
|
||||||
s.tasks = append(s.tasks[:i], s.tasks[i+1:]...)
|
|
||||||
|
|
||||||
if len(s.tasks) == 0 {
|
|
||||||
log.Println("Done scheduling all tasks")
|
|
||||||
// Need to stop the cluster-wide capping as there aren't any more tasks to schedule
|
|
||||||
s.stopCapping()
|
|
||||||
s.startRecapping() // Load changes after every task finishes and hence, we need to change the capping of the cluster
|
|
||||||
close(s.Shutdown)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
break // Offer taken, move on
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// If there was no match for the task
|
|
||||||
if !offerTaken {
|
|
||||||
fmt.Println("There is not enough resources to launch a task:")
|
|
||||||
cpus, mem, watts := offerUtils.OfferAgg(offer)
|
|
||||||
|
|
||||||
log.Printf("<CPU: %f, RAM: %f, Watts: %f>\n", cpus, mem, watts)
|
|
||||||
driver.DeclineOffer(offer.Id, mesosUtils.DefaultFilter)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func (s *FirstFitSortedWattsClassMapWattsProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
|
||||||
log.Printf("Received task status [%s] for task [%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
||||||
s.tasksRunning++
|
|
||||||
} else if IsTerminal(status.State) {
|
|
||||||
delete(s.running[status.GetSlaveId().GoString()], *status.TaskId.Value)
|
|
||||||
// Need to remove the task from the window
|
|
||||||
s.capper.TaskFinished(*status.TaskId.Value)
|
|
||||||
// Determining the new cluster wide recap value
|
|
||||||
//tempCap, err := s.capper.NaiveRecap(s.totalPower, s.taskMonitor, *status.TaskId.Value)
|
|
||||||
tempCap, err := s.capper.CleverRecap(s.totalPower, s.taskMonitor, *status.TaskId.Value)
|
|
||||||
if err == nil {
|
|
||||||
// If new determined cap value is different from the current recap value, then we need to recap
|
|
||||||
if int(math.Floor(tempCap+0.5)) != int(math.Floor(ffswClassMapWattsProacCCRecapValue+0.5)) {
|
|
||||||
ffswClassMapWattsProacCCRecapValue = tempCap
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = true
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
log.Printf("Determined re-cap value: %f\n", ffswClassMapWattsProacCCRecapValue)
|
|
||||||
} else {
|
|
||||||
ffswClassMapWattsProacCCMutex.Lock()
|
|
||||||
s.isRecapping = false
|
|
||||||
ffswClassMapWattsProacCCMutex.Unlock()
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
log.Println(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
s.tasksRunning--
|
|
||||||
if s.tasksRunning == 0 {
|
|
||||||
select {
|
|
||||||
case <-s.Shutdown:
|
|
||||||
// Need to stop the cluster-wide recapping
|
|
||||||
s.stopRecapping()
|
|
||||||
close(s.Done)
|
|
||||||
default:
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
log.Printf("DONE: Task status [%s] for task[%s]", NameFor(status.State), *status.TaskId.Value)
|
|
||||||
}
|
|
|
@ -31,32 +31,38 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to taken an offer or not
|
// Decides if to taken an offer or not
|
||||||
func (s *ProactiveClusterwideCapRanked) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
func (s *FirstFitSortedWattsProacCC) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
offer_cpu, offer_mem, offer_watts := offerUtils.OfferAgg(offer)
|
offer_cpu, offer_mem, offer_watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
if offer_cpu >= task.CPU && offer_mem >= task.RAM && (s.ignoreWatts || (offer_watts >= task.Watts)) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsToConsider
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if offer_cpu >= task.CPU && offer_mem >= task.RAM && (!s.wattsAsAResource || offer_watts >= wattsConsideration) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type ProactiveClusterwideCapRanked struct {
|
type FirstFitSortedWattsProacCC struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
taskMonitor map[string][]def.Task // store tasks that are currently running.
|
taskMonitor map[string][]def.Task // store tasks that are currently running.
|
||||||
availablePower map[string]float64 // available power for each node in the cluster.
|
availablePower map[string]float64 // available power for each node in the cluster.
|
||||||
totalPower map[string]float64 // total power for each node in the cluster.
|
totalPower map[string]float64 // total power for each node in the cluster.
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
capper *powCap.ClusterwideCapper
|
classMapWatts bool
|
||||||
ticker *time.Ticker
|
capper *powCap.ClusterwideCapper
|
||||||
recapTicker *time.Ticker
|
ticker *time.Ticker
|
||||||
isCapping bool // indicate whether we are currently performing cluster wide capping.
|
recapTicker *time.Ticker
|
||||||
isRecapping bool // indicate whether we are currently performing cluster wide re-capping.
|
isCapping bool // indicate whether we are currently performing cluster wide capping.
|
||||||
|
isRecapping bool // indicate whether we are currently performing cluster wide re-capping.
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule the new task.
|
// about to schedule the new task.
|
||||||
|
@ -77,30 +83,35 @@ type ProactiveClusterwideCapRanked struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler.
|
// New electron scheduler.
|
||||||
func NewProactiveClusterwideCapRanked(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *ProactiveClusterwideCapRanked {
|
func NewFirstFitSortedWattsProacCC(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *FirstFitSortedWattsProacCC {
|
||||||
|
|
||||||
|
// Sorting tasks in ascending order of watts
|
||||||
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
log.Fatal(err)
|
log.Fatal(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &ProactiveClusterwideCapRanked{
|
s := &FirstFitSortedWattsProacCC{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
taskMonitor: make(map[string][]def.Task),
|
running: make(map[string]map[string]bool),
|
||||||
availablePower: make(map[string]float64),
|
taskMonitor: make(map[string][]def.Task),
|
||||||
totalPower: make(map[string]float64),
|
availablePower: make(map[string]float64),
|
||||||
RecordPCP: false,
|
totalPower: make(map[string]float64),
|
||||||
capper: powCap.GetClusterwideCapperInstance(),
|
RecordPCP: false,
|
||||||
ticker: time.NewTicker(10 * time.Second),
|
capper: powCap.GetClusterwideCapperInstance(),
|
||||||
recapTicker: time.NewTicker(20 * time.Second),
|
ticker: time.NewTicker(10 * time.Second),
|
||||||
isCapping: false,
|
recapTicker: time.NewTicker(20 * time.Second),
|
||||||
isRecapping: false,
|
isCapping: false,
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
isRecapping: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -108,7 +119,7 @@ func NewProactiveClusterwideCapRanked(tasks []def.Task, ignoreWatts bool, schedT
|
||||||
// mutex
|
// mutex
|
||||||
var rankedMutex sync.Mutex
|
var rankedMutex sync.Mutex
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapRanked) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
func (s *FirstFitSortedWattsProacCC) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -139,8 +150,13 @@ func (s *ProactiveClusterwideCapRanked) newTask(offer *mesos.Offer, task def.Tas
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsToConsider
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -163,7 +179,7 @@ func (s *ProactiveClusterwideCapRanked) newTask(offer *mesos.Offer, task def.Tas
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapRanked) Disconnected(sched.SchedulerDriver) {
|
func (s *FirstFitSortedWattsProacCC) Disconnected(sched.SchedulerDriver) {
|
||||||
// Need to stop the capping process.
|
// Need to stop the capping process.
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
s.recapTicker.Stop()
|
s.recapTicker.Stop()
|
||||||
|
@ -175,7 +191,7 @@ func (s *ProactiveClusterwideCapRanked) Disconnected(sched.SchedulerDriver) {
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
// go routine to cap the entire cluster in regular intervals of time.
|
||||||
var rankedCurrentCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
var rankedCurrentCapValue = 0.0 // initial value to indicate that we haven't capped the cluster yet.
|
||||||
func (s *ProactiveClusterwideCapRanked) startCapping() {
|
func (s *FirstFitSortedWattsProacCC) startCapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -184,7 +200,7 @@ func (s *ProactiveClusterwideCapRanked) startCapping() {
|
||||||
rankedMutex.Lock()
|
rankedMutex.Lock()
|
||||||
if rankedCurrentCapValue > 0.0 {
|
if rankedCurrentCapValue > 0.0 {
|
||||||
for _, host := range constants.Hosts {
|
for _, host := range constants.Hosts {
|
||||||
// Rounding curreCapValue to the nearest int.
|
// Rounding currentCapValue to the nearest int.
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(rankedCurrentCapValue+0.5))); err != nil {
|
if err := rapl.Cap(host, "rapl", int(math.Floor(rankedCurrentCapValue+0.5))); err != nil {
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
|
@ -199,7 +215,7 @@ func (s *ProactiveClusterwideCapRanked) startCapping() {
|
||||||
|
|
||||||
// go routine to cap the entire cluster in regular intervals of time.
|
// go routine to cap the entire cluster in regular intervals of time.
|
||||||
var rankedRecapValue = 0.0 // The cluster wide cap value when recapping.
|
var rankedRecapValue = 0.0 // The cluster wide cap value when recapping.
|
||||||
func (s *ProactiveClusterwideCapRanked) startRecapping() {
|
func (s *FirstFitSortedWattsProacCC) startRecapping() {
|
||||||
go func() {
|
go func() {
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
|
@ -208,7 +224,7 @@ func (s *ProactiveClusterwideCapRanked) startRecapping() {
|
||||||
// If stopped performing cluster wide capping then we need to explicitly cap the entire cluster.
|
// If stopped performing cluster wide capping then we need to explicitly cap the entire cluster.
|
||||||
if s.isRecapping && rankedRecapValue > 0.0 {
|
if s.isRecapping && rankedRecapValue > 0.0 {
|
||||||
for _, host := range constants.Hosts {
|
for _, host := range constants.Hosts {
|
||||||
// Rounding curreCapValue to the nearest int.
|
// Rounding currentCapValue to the nearest int.
|
||||||
if err := rapl.Cap(host, "rapl", int(math.Floor(rankedRecapValue+0.5))); err != nil {
|
if err := rapl.Cap(host, "rapl", int(math.Floor(rankedRecapValue+0.5))); err != nil {
|
||||||
log.Println(err)
|
log.Println(err)
|
||||||
}
|
}
|
||||||
|
@ -224,7 +240,7 @@ func (s *ProactiveClusterwideCapRanked) startRecapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop cluster wide capping
|
// Stop cluster wide capping
|
||||||
func (s *ProactiveClusterwideCapRanked) stopCapping() {
|
func (s *FirstFitSortedWattsProacCC) stopCapping() {
|
||||||
if s.isCapping {
|
if s.isCapping {
|
||||||
log.Println("Stopping the cluster wide capping.")
|
log.Println("Stopping the cluster wide capping.")
|
||||||
s.ticker.Stop()
|
s.ticker.Stop()
|
||||||
|
@ -236,7 +252,7 @@ func (s *ProactiveClusterwideCapRanked) stopCapping() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Stop cluster wide Recapping
|
// Stop cluster wide Recapping
|
||||||
func (s *ProactiveClusterwideCapRanked) stopRecapping() {
|
func (s *FirstFitSortedWattsProacCC) stopRecapping() {
|
||||||
// If not capping, then definitely recapping.
|
// If not capping, then definitely recapping.
|
||||||
if !s.isCapping && s.isRecapping {
|
if !s.isCapping && s.isRecapping {
|
||||||
log.Println("Stopping the cluster wide re-capping.")
|
log.Println("Stopping the cluster wide re-capping.")
|
||||||
|
@ -247,7 +263,7 @@ func (s *ProactiveClusterwideCapRanked) stopRecapping() {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapRanked) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
func (s *FirstFitSortedWattsProacCC) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.Offer) {
|
||||||
log.Printf("Received %d resource offers", len(offers))
|
log.Printf("Received %d resource offers", len(offers))
|
||||||
|
|
||||||
// retrieving the available power for all the hosts in the offers.
|
// retrieving the available power for all the hosts in the offers.
|
||||||
|
@ -264,16 +280,6 @@ func (s *ProactiveClusterwideCapRanked) ResourceOffers(driver sched.SchedulerDri
|
||||||
log.Printf("TotalPower[%s] = %f", host, tpower)
|
log.Printf("TotalPower[%s] = %f", host, tpower)
|
||||||
}
|
}
|
||||||
|
|
||||||
// sorting the tasks in ascending order of watts.
|
|
||||||
if len(s.tasks) > 0 {
|
|
||||||
sort.Sort(def.WattsSorter(s.tasks))
|
|
||||||
// calculating the total number of tasks ranked.
|
|
||||||
numberOfRankedTasks := 0
|
|
||||||
for _, task := range s.tasks {
|
|
||||||
numberOfRankedTasks += *task.Instances
|
|
||||||
}
|
|
||||||
log.Printf("Ranked %d tasks in ascending order of tasks.", numberOfRankedTasks)
|
|
||||||
}
|
|
||||||
for _, offer := range offers {
|
for _, offer := range offers {
|
||||||
select {
|
select {
|
||||||
case <-s.Shutdown:
|
case <-s.Shutdown:
|
||||||
|
@ -363,7 +369,7 @@ func (s *ProactiveClusterwideCapRanked) ResourceOffers(driver sched.SchedulerDri
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *ProactiveClusterwideCapRanked) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
func (s *FirstFitSortedWattsProacCC) StatusUpdate(driver sched.SchedulerDriver, status *mesos.TaskStatus) {
|
||||||
log.Printf("Received task status [%s] for task [%s]\n", NameFor(status.State), *status.TaskId.Value)
|
log.Printf("Received task status [%s] for task [%s]\n", NameFor(status.State), *status.TaskId.Value)
|
||||||
|
|
||||||
if *status.State == mesos.TaskState_TASK_RUNNING {
|
if *status.State == mesos.TaskState_TASK_RUNNING {
|
|
@ -22,7 +22,12 @@ func (s *FirstFitSortedWattsSortedOffers) takeOffer(offer *mesos.Offer, task def
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
|
||||||
if cpus >= task.CPU && mem >= task.RAM && (s.ignoreWatts || watts >= task.Watts) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || watts >= wattsConsideration) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -31,13 +36,14 @@ func (s *FirstFitSortedWattsSortedOffers) takeOffer(offer *mesos.Offer, task def
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type FirstFitSortedWattsSortedOffers struct {
|
type FirstFitSortedWattsSortedOffers struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -57,7 +63,8 @@ type FirstFitSortedWattsSortedOffers struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewFirstFitSortedWattsSortedOffers(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitSortedWattsSortedOffers {
|
func NewFirstFitSortedWattsSortedOffers(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string,
|
||||||
|
classMapWatts bool) *FirstFitSortedWattsSortedOffers {
|
||||||
|
|
||||||
// Sorting the tasks in increasing order of watts requirement.
|
// Sorting the tasks in increasing order of watts requirement.
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
@ -68,14 +75,15 @@ func NewFirstFitSortedWattsSortedOffers(tasks []def.Task, ignoreWatts bool, sche
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &FirstFitSortedWattsSortedOffers{
|
s := &FirstFitSortedWattsSortedOffers{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -103,8 +111,14 @@ func (s *FirstFitSortedWattsSortedOffers) newTask(offer *mesos.Offer, task def.T
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
|
|
@ -22,7 +22,12 @@ func (s *FirstFitSortedWatts) takeOffer(offer *mesos.Offer, task def.Task) bool
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
|
||||||
if cpus >= task.CPU && mem >= task.RAM && (s.ignoreWatts || watts >= task.Watts) {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if cpus >= task.CPU && mem >= task.RAM && (!s.wattsAsAResource || watts >= wattsConsideration) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -31,13 +36,14 @@ func (s *FirstFitSortedWatts) takeOffer(offer *mesos.Offer, task def.Task) bool
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type FirstFitSortedWatts struct {
|
type FirstFitSortedWatts struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -57,7 +63,7 @@ type FirstFitSortedWatts struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewFirstFitSortedWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitSortedWatts {
|
func NewFirstFitSortedWatts(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *FirstFitSortedWatts {
|
||||||
|
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
|
@ -67,14 +73,15 @@ func NewFirstFitSortedWatts(tasks []def.Task, ignoreWatts bool, schedTracePrefix
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &FirstFitSortedWatts{
|
s := &FirstFitSortedWatts{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -102,8 +109,14 @@ func (s *FirstFitSortedWatts) newTask(offer *mesos.Offer, task def.Task) *mesos.
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.Watts))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
|
|
@ -15,13 +15,18 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
// Decides if to take an offer or not
|
// Decides if to take an offer or not
|
||||||
func (*FirstFitWattsOnly) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
func (s *FirstFitWattsOnly) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
|
|
||||||
_, _, watts := offerUtils.OfferAgg(offer)
|
_, _, watts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
//TODO: Insert watts calculation here instead of taking them as a parameter
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
|
||||||
if watts >= task.Watts {
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
if watts >= wattsConsideration {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -29,13 +34,14 @@ func (*FirstFitWattsOnly) takeOffer(offer *mesos.Offer, task def.Task) bool {
|
||||||
}
|
}
|
||||||
|
|
||||||
type FirstFitWattsOnly struct {
|
type FirstFitWattsOnly struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
tasksCreated int
|
tasksCreated int
|
||||||
tasksRunning int
|
tasksRunning int
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
// about to schedule a new task
|
// about to schedule a new task
|
||||||
|
@ -55,7 +61,7 @@ type FirstFitWattsOnly struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewFirstFitWattsOnly(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *FirstFitWattsOnly {
|
func NewFirstFitWattsOnly(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *FirstFitWattsOnly {
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
@ -63,14 +69,15 @@ func NewFirstFitWattsOnly(tasks []def.Task, ignoreWatts bool, schedTracePrefix s
|
||||||
}
|
}
|
||||||
|
|
||||||
s := &FirstFitWattsOnly{
|
s := &FirstFitWattsOnly{
|
||||||
tasks: tasks,
|
tasks: tasks,
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
@ -93,8 +100,13 @@ func (s *FirstFitWattsOnly) newTask(offer *mesos.Offer, task def.Task) *mesos.Ta
|
||||||
// Add task to list of tasks running on node
|
// Add task to list of tasks running on node
|
||||||
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
s.running[offer.GetSlaveId().GoString()][taskName] = true
|
||||||
|
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
resources := []*mesos.Resource{
|
resources := []*mesos.Resource{
|
||||||
mesosutil.NewScalarResource("watts", task.Watts),
|
mesosutil.NewScalarResource("watts", wattsConsideration),
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
|
|
@ -1,11 +1,9 @@
|
||||||
package schedulers
|
package schedulers
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"bitbucket.org/sunybingcloud/electron/constants"
|
||||||
"fmt"
|
"fmt"
|
||||||
"log"
|
"log"
|
||||||
"bitbucket.org/sunybingcloud/electron/def"
|
|
||||||
mesos "github.com/mesos/mesos-go/mesosproto"
|
|
||||||
"bitbucket.org/sunybingcloud/electron/utilities/offerUtils"
|
|
||||||
)
|
)
|
||||||
|
|
||||||
func coLocated(tasks map[string]bool) {
|
func coLocated(tasks map[string]bool) {
|
||||||
|
@ -17,21 +15,12 @@ func coLocated(tasks map[string]bool) {
|
||||||
fmt.Println("---------------------")
|
fmt.Println("---------------------")
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
// Get the powerClass of the given hostname
|
||||||
Determine the watts value to consider for each task.
|
func hostToPowerClass(hostName string) string {
|
||||||
|
for powerClass, hosts := range constants.PowerClasses {
|
||||||
This value could either be task.Watts or task.ClassToWatts[<power class>]
|
if ok := hosts[hostName]; ok {
|
||||||
If task.ClassToWatts is not present, then return task.Watts (this would be for workloads which don't have classMapWatts)
|
return powerClass
|
||||||
*/
|
|
||||||
func wattsToConsider(task def.Task, classMapWatts bool, offer *mesos.Offer) float64 {
|
|
||||||
if classMapWatts {
|
|
||||||
// checking if ClassToWatts was present in the workload.
|
|
||||||
if task.ClassToWatts != nil {
|
|
||||||
return task.ClassToWatts[offerUtils.PowerClass(offer)]
|
|
||||||
} else {
|
|
||||||
return task.Watts
|
|
||||||
}
|
}
|
||||||
} else {
|
|
||||||
return task.Watts
|
|
||||||
}
|
}
|
||||||
|
return ""
|
||||||
}
|
}
|
||||||
|
|
|
@ -26,6 +26,30 @@ This was done to give a little more room for the large tasks (power intensive) f
|
||||||
starvation of power intensive tasks.
|
starvation of power intensive tasks.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
func (s *TopHeavy) takeOfferBinPack(offer *mesos.Offer, totalCPU, totalRAM, totalWatts,
|
||||||
|
wattsToConsider float64, task def.Task) bool {
|
||||||
|
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
if (!s.wattsAsAResource || (offerWatts >= (totalWatts + wattsToConsider))) &&
|
||||||
|
(offerCPU >= (totalCPU + task.CPU)) &&
|
||||||
|
(offerRAM >= (totalRAM + task.RAM)) {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
func (s *TopHeavy) takeOfferFirstFit(offer *mesos.Offer, wattsConsideration float64, task def.Task) bool {
|
||||||
|
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
||||||
|
|
||||||
|
//TODO: Insert watts calculation here instead of taking them as a parameter
|
||||||
|
if (!s.wattsAsAResource || (offerWatts >= wattsConsideration)) &&
|
||||||
|
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
// electronScheduler implements the Scheduler interface
|
// electronScheduler implements the Scheduler interface
|
||||||
type TopHeavy struct {
|
type TopHeavy struct {
|
||||||
base // Type embedded to inherit common functions
|
base // Type embedded to inherit common functions
|
||||||
|
@ -34,7 +58,8 @@ type TopHeavy struct {
|
||||||
tasks []def.Task
|
tasks []def.Task
|
||||||
metrics map[string]def.Metric
|
metrics map[string]def.Metric
|
||||||
running map[string]map[string]bool
|
running map[string]map[string]bool
|
||||||
ignoreWatts bool
|
wattsAsAResource bool
|
||||||
|
classMapWatts bool
|
||||||
smallTasks, largeTasks []def.Task
|
smallTasks, largeTasks []def.Task
|
||||||
|
|
||||||
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
// First set of PCP values are garbage values, signal to logger to start recording when we're
|
||||||
|
@ -55,7 +80,7 @@ type TopHeavy struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// New electron scheduler
|
// New electron scheduler
|
||||||
func NewPackSmallSpreadBig(tasks []def.Task, ignoreWatts bool, schedTracePrefix string) *TopHeavy {
|
func NewTopHeavy(tasks []def.Task, wattsAsAResource bool, schedTracePrefix string, classMapWatts bool) *TopHeavy {
|
||||||
sort.Sort(def.WattsSorter(tasks))
|
sort.Sort(def.WattsSorter(tasks))
|
||||||
|
|
||||||
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
logFile, err := os.Create("./" + schedTracePrefix + "_schedTrace.log")
|
||||||
|
@ -67,20 +92,21 @@ func NewPackSmallSpreadBig(tasks []def.Task, ignoreWatts bool, schedTracePrefix
|
||||||
// Classification done based on MMPU watts requirements.
|
// Classification done based on MMPU watts requirements.
|
||||||
mid := int(math.Floor((float64(len(tasks)) / 2.0) + 0.5))
|
mid := int(math.Floor((float64(len(tasks)) / 2.0) + 0.5))
|
||||||
s := &TopHeavy{
|
s := &TopHeavy{
|
||||||
smallTasks: tasks[:mid],
|
smallTasks: tasks[:mid],
|
||||||
largeTasks: tasks[mid+1:],
|
largeTasks: tasks[mid+1:],
|
||||||
ignoreWatts: ignoreWatts,
|
wattsAsAResource: wattsAsAResource,
|
||||||
Shutdown: make(chan struct{}),
|
classMapWatts: classMapWatts,
|
||||||
Done: make(chan struct{}),
|
Shutdown: make(chan struct{}),
|
||||||
PCPLog: make(chan struct{}),
|
Done: make(chan struct{}),
|
||||||
running: make(map[string]map[string]bool),
|
PCPLog: make(chan struct{}),
|
||||||
RecordPCP: false,
|
running: make(map[string]map[string]bool),
|
||||||
schedTrace: log.New(logFile, "", log.LstdFlags),
|
RecordPCP: false,
|
||||||
|
schedTrace: log.New(logFile, "", log.LstdFlags),
|
||||||
}
|
}
|
||||||
return s
|
return s
|
||||||
}
|
}
|
||||||
|
|
||||||
func (s *TopHeavy) newTask(offer *mesos.Offer, task def.Task, newTaskClass string) *mesos.TaskInfo {
|
func (s *TopHeavy) newTask(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
taskName := fmt.Sprintf("%s-%d", task.Name, *task.Instances)
|
||||||
s.tasksCreated++
|
s.tasksCreated++
|
||||||
|
|
||||||
|
@ -103,8 +129,14 @@ func (s *TopHeavy) newTask(offer *mesos.Offer, task def.Task, newTaskClass strin
|
||||||
mesosutil.NewScalarResource("mem", task.RAM),
|
mesosutil.NewScalarResource("mem", task.RAM),
|
||||||
}
|
}
|
||||||
|
|
||||||
if !s.ignoreWatts {
|
if s.wattsAsAResource {
|
||||||
resources = append(resources, mesosutil.NewScalarResource("watts", task.ClassToWatts[newTaskClass]))
|
if wattsToConsider, err := def.WattsToConsider(task, s.classMapWatts, offer); err == nil {
|
||||||
|
log.Printf("Watts considered for host[%s] and task[%s] = %f", *offer.Hostname, task.Name, wattsToConsider)
|
||||||
|
resources = append(resources, mesosutil.NewScalarResource("watts", wattsToConsider))
|
||||||
|
} else {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return &mesos.TaskInfo{
|
return &mesos.TaskInfo{
|
||||||
|
@ -136,11 +168,10 @@ func (s *TopHeavy) shutDownIfNecessary() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// create TaskInfo and log scheduling trace
|
// create TaskInfo and log scheduling trace
|
||||||
func (s *TopHeavy) createTaskInfoAndLogSchedTrace(offer *mesos.Offer,
|
func (s *TopHeavy) createTaskInfoAndLogSchedTrace(offer *mesos.Offer, task def.Task) *mesos.TaskInfo {
|
||||||
powerClass string, task def.Task) *mesos.TaskInfo {
|
|
||||||
log.Println("Co-Located with:")
|
log.Println("Co-Located with:")
|
||||||
coLocated(s.running[offer.GetSlaveId().GoString()])
|
coLocated(s.running[offer.GetSlaveId().GoString()])
|
||||||
taskToSchedule := s.newTask(offer, task, powerClass)
|
taskToSchedule := s.newTask(offer, task)
|
||||||
|
|
||||||
fmt.Println("Inst: ", *task.Instances)
|
fmt.Println("Inst: ", *task.Instances)
|
||||||
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
s.schedTrace.Print(offer.GetHostname() + ":" + taskToSchedule.GetTaskId().GetValue())
|
||||||
|
@ -162,31 +193,28 @@ func (s *TopHeavy) pack(offers []*mesos.Offer, driver sched.SchedulerDriver) {
|
||||||
}
|
}
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
tasks := []*mesos.TaskInfo{}
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
totalWatts := 0.0
|
totalWatts := 0.0
|
||||||
totalCPU := 0.0
|
totalCPU := 0.0
|
||||||
totalRAM := 0.0
|
totalRAM := 0.0
|
||||||
taken := false
|
taken := false
|
||||||
for i := 0; i < len(s.smallTasks); i++ {
|
for i := 0; i < len(s.smallTasks); i++ {
|
||||||
task := s.smallTasks[i]
|
task := s.smallTasks[i]
|
||||||
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
for *task.Instances > 0 {
|
for *task.Instances > 0 {
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
|
||||||
// Does the task fit
|
// Does the task fit
|
||||||
// OR lazy evaluation. If ignore watts is set to true, second statement won't
|
// OR lazy evaluation. If ignore watts is set to true, second statement won't
|
||||||
// be evaluated.
|
// be evaluated.
|
||||||
wattsToConsider := task.Watts
|
if s.takeOfferBinPack(offer, totalCPU, totalRAM, totalWatts, wattsConsideration, task) {
|
||||||
if !s.ignoreWatts {
|
|
||||||
wattsToConsider = task.ClassToWatts[powerClass]
|
|
||||||
}
|
|
||||||
if (s.ignoreWatts || (offerWatts >= (totalWatts + wattsToConsider))) &&
|
|
||||||
(offerCPU >= (totalCPU + task.CPU)) &&
|
|
||||||
(offerRAM >= (totalRAM + task.RAM)) {
|
|
||||||
taken = true
|
taken = true
|
||||||
totalWatts += wattsToConsider
|
totalWatts += wattsConsideration
|
||||||
totalCPU += task.CPU
|
totalCPU += task.CPU
|
||||||
totalRAM += task.RAM
|
totalRAM += task.RAM
|
||||||
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, powerClass, task))
|
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, task))
|
||||||
|
|
||||||
if *task.Instances <= 0 {
|
if *task.Instances <= 0 {
|
||||||
// All instances of task have been scheduled, remove it
|
// All instances of task have been scheduled, remove it
|
||||||
|
@ -227,21 +255,19 @@ func (s *TopHeavy) spread(offers []*mesos.Offer, driver sched.SchedulerDriver) {
|
||||||
}
|
}
|
||||||
|
|
||||||
tasks := []*mesos.TaskInfo{}
|
tasks := []*mesos.TaskInfo{}
|
||||||
offerCPU, offerRAM, offerWatts := offerUtils.OfferAgg(offer)
|
|
||||||
offerTaken := false
|
offerTaken := false
|
||||||
for i := 0; i < len(s.largeTasks); i++ {
|
for i := 0; i < len(s.largeTasks); i++ {
|
||||||
task := s.largeTasks[i]
|
task := s.largeTasks[i]
|
||||||
powerClass := offerUtils.PowerClass(offer)
|
wattsConsideration, err := def.WattsToConsider(task, s.classMapWatts, offer)
|
||||||
|
if err != nil {
|
||||||
|
// Error in determining wattsConsideration
|
||||||
|
log.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// Decision to take the offer or not
|
// Decision to take the offer or not
|
||||||
wattsToConsider := task.Watts
|
if s.takeOfferFirstFit(offer, wattsConsideration, task) {
|
||||||
if !s.ignoreWatts {
|
|
||||||
wattsToConsider = task.ClassToWatts[powerClass]
|
|
||||||
}
|
|
||||||
if (s.ignoreWatts || (offerWatts >= wattsToConsider)) &&
|
|
||||||
(offerCPU >= task.CPU) && (offerRAM >= task.RAM) {
|
|
||||||
offerTaken = true
|
offerTaken = true
|
||||||
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, powerClass, task))
|
tasks = append(tasks, s.createTaskInfoAndLogSchedTrace(offer, task))
|
||||||
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
log.Printf("Starting %s on [%s]\n", task.Name, offer.GetHostname())
|
||||||
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
driver.LaunchTasks([]*mesos.OfferID{offer.Id}, tasks, mesosUtils.DefaultFilter)
|
||||||
|
|
||||||
|
@ -286,10 +312,10 @@ func (s *TopHeavy) ResourceOffers(driver sched.SchedulerDriver, offers []*mesos.
|
||||||
default:
|
default:
|
||||||
}
|
}
|
||||||
|
|
||||||
if constants.PowerClasses["ClassA"][*offer.Hostname] ||
|
if constants.PowerClasses["A"][*offer.Hostname] ||
|
||||||
constants.PowerClasses["ClassB"][*offer.Hostname] {
|
constants.PowerClasses["B"][*offer.Hostname] {
|
||||||
offersClassAB = append(offersClassAB, offer)
|
offersClassAB = append(offersClassAB, offer)
|
||||||
} else if constants.PowerClasses["ClassC"][*offer.Hostname] {
|
} else if constants.PowerClasses["C"][*offer.Hostname] {
|
||||||
offersClassC = append(offersClassC, offer)
|
offersClassC = append(offersClassC, offer)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,6 +1,8 @@
|
||||||
package utilities
|
package utilities
|
||||||
|
|
||||||
import "errors"
|
import (
|
||||||
|
"errors"
|
||||||
|
)
|
||||||
|
|
||||||
/*
|
/*
|
||||||
The Pair and PairList have been taken from google groups forum,
|
The Pair and PairList have been taken from google groups forum,
|
||||||
|
@ -43,12 +45,3 @@ func OrderedKeys(plist PairList) ([]string, error) {
|
||||||
}
|
}
|
||||||
return orderedKeys, nil
|
return orderedKeys, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// determine the max value
|
|
||||||
func Max(a, b float64) float64 {
|
|
||||||
if a > b {
|
|
||||||
return a
|
|
||||||
} else {
|
|
||||||
return b
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
Reference in a new issue