From 91d0c6f341c790e0987c0ee09b7c022eda0f69c9 Mon Sep 17 00:00:00 2001 From: Pradyumna Kaushik Date: Mon, 31 Oct 2016 21:41:59 -0400 Subject: [PATCH] Modified readme to include commands to build and run the program and also added documentation to mention what main.go contains --- schedulers/proactive_dynamic_capping/README.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/schedulers/proactive_dynamic_capping/README.md b/schedulers/proactive_dynamic_capping/README.md index 60f4431..4066b73 100644 --- a/schedulers/proactive_dynamic_capping/README.md +++ b/schedulers/proactive_dynamic_capping/README.md @@ -6,5 +6,14 @@ 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.