Algorithm 1 Single-Contract Resource Reservation Policy

Input: Demand vector $D\left[1,\dots ,T\right]$, contract k.    (1) $D^s\leftarrow sort\left(D\right)$;    (2) $lastsum\triangleq \frac{R_k}{\alpha }$ from Theorem 1;       $i=0$;       $sum=0$;       while ($sum<lastsum$) do          $i=i+1$;          $sum=sum+D^s(T-i+1)$;       endwhile    (3) Number of reserved instances ←$D^s(T-i+1)\times T$;