spdf/elektron
Archived
1
0
Fork 0
Code Issues 4 Pull requests 1 Projects Releases Packages Wiki Activity
This repository has been archived on 2024-04-10. You can view files and clone it, but you cannot make any changes to it's state, such as pushing and creating new issues, pull requests or comments.
elektron/schedulers/proactive_dynamic_capping
History
Pradyumna Kaushik 4761de1399 fixed an error in the readme file
2016-12-22 22:58:59 -05:00
..
src Added proactive dynamic capping (FCFS and Rank based). Also added a primitive readme file. 2016-12-22 22:58:59 -05:00
main.go Added proactive dynamic capping (FCFS and Rank based). Also added a primitive readme file. 2016-12-22 22:58:59 -05:00
README.md fixed an error in the readme file 2016-12-22 22:58:59 -05:00

README.md

##Proactive Dynamic Capping

Perform Cluster wide dynamic capping.

Offer 2 methods: 1. First Come First Serve -- For each task that needs to be scheduled, in the order in which it arrives, compute the cluster wide cap. 2. Rank based cluster wide capping -- Sort a given set of tasks to be scheduled, in ascending order of requested watts, and then compute the cluster wide cap for each of the tasks in the ordered set.

main.go contains a set of test functions for the above algorithm.

#Please run the following commands to install dependencies and run the test code.

	go build
	go run main.go

#Note The github.com folder contains a library that is required to compute the median of a given set of values.