Optimum Online Algorithm Sample Clauses

Optimum Online Algorithm. Though optimum offline algorithm achieves the best possible performance (minimum cost) for any given input, in the real world it is not possible to have advanced knowledge of SLAV and VM requirements. This necessitates the need for an online algorithm that can achieve the best possible result on unforeseen input sequences, i.e., the algorithm needs to decide if and when it needs to start a migration? It is possible that the online algorithm starts migration too early and later she observes that it would have been better not to migrate at all (referred to as too early error). Likewise, it is also possible that the online algorithm starts the migration too late, and in the hindsight, it would have been better to initiate a migration as soon as the SLAV occurred (referred to as too late error). Therefore, the online algorithm has to find a time point to balance the too early error and the too late error. Let us assume that Wt is the time that an online algorithm will wait after the start of SLAV before initiating a migration. Therefore, the best decision in this situation is to start migration only when the SLAV cost equals migration cost, i.e., SLAVCost = MigrationCost ▇▇.▇▇ = f (Cit) .g (Vit) f (Cit).g(Vit) Wt = C