Bart van MerriĆ«nboer edited Algorithm.tex  over 10 years ago

Commit id: d4f5a65158a83fba2f89e273db8c39382f68a7f6

deletions | additions      

       

\begin{itemize}  \item Our forecast of the arrival rate $\lambda(t)$, especially 2 minutes and 1 hour from now  \itemThe number of VMs in each category currently running   \item  How far the VMs are from their next billing period(no need to shut it down until 1 second before the hour)  \item The length of the queue right now, and forecasts for  the estimated queues   \end{itemize}     A few heuristics that I can think off:     \begin{itemize}   \item If we  forecast queue length a peak in demand 1 hour from now, we should start up VMs half an hour before so that the peak of demand falls in the middle of the VM cycle   \item Never shut down a VM until 1 second before its billing cycle   \item Calculate the estimated penalty we have to pay in the next 1 hour (integrating the waiting time distribution over the penalty function) for $c$ and $c + 1$ VMs. If the difference is greater than 1, we should start an extra server.  \end{itemize}