Average Slowdown Competitive Analysis of Algorithm AAIMD
Zhiying Yang · Journal of Guangxi Normal University · 2008
The performance of Algorithm AAIMD is analyzed under online setting with neither job preemption nor migration.The aim is to study the performance of competitive ratio under the metric of average slowdown.It's showed that Algorithm AAIMD achieves a constant competitive ratio even if the optimal off-line adversary is allowed to have job preemption and migration.