Entropy-based bounds for online algorithms
ACM Transactions on Algorithms, ArticleNo.7, 2007.
stochastic processcompetitive analysisonline algorithmscompetitive ratiooperating systemMore(4+)
We focus in this work on an aspect of online computation that is not addressed by standard competitive analysis, namely, identifying request sequences for which nontrivial online algorithms are useful versus request sequences for which all algorithms perform equally poorly. The motivations for this work are advanced system and architectur...More
Full Text (Upload PDF)
PPT (Upload PPT)