added utility to compute the scheduling window. Right now there's only criteria on which this is determined -- fillNextOfferCycle. So, the schedWindow is the max number of tasks, that aren't yet scheduled, whose aggregate resource requirement is as close as possible to the resource available in the next round of resource offers. To be able to make the most use of the next offer cycle, one would need to perform a non-polynomial search of the TaskQueue and as this is computationally expensive, a linear search is performed on the TaskQueue. Retrofitted scheduling policies to also call utilities.schedUtils#schedWindowResizingStrategy#Apply before switching to a new scheduling policy.

rapl/cap.go

@@ -1,11 +1,11 @@
 package rapl
 
 import (
+	elekEnv "bitbucket.org/sunybingcloud/elektron/environment"
 	"github.com/pkg/errors"
 	"golang.org/x/crypto/ssh"
-	"strconv"
 	"os"
-	elekEnv "bitbucket.org/sunybingcloud/elektron/environment"
+	"strconv"
 )
 
 func Cap(host, username string, percentage float64) error {