Affiliation:
1. University of Southern Denmark, Odense M, Denmark
Abstract
In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request arrives. Online algorithms with advice is an area of research where one attempts to measure how much knowledge of future requests is necessary to achieve a given performance level, as defined by the competitive ratio. When this knowledge, the advice, is obtainable, this leads to practical algorithms, called semi-online algorithms. On the other hand, each negative result gives robust results about the limitations of a broad range of semi-online algorithms. This survey explains the models for online algorithms with advice, motivates the study in general, presents some examples of the work that has been carried out, and includes an extensive set of references, organized by problem studied.
Funder
Villum Foundation
Danish Council for Independent Research, Natural Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference105 articles.
1. Competitive analysis of randomized paging algorithms
2. Anna Adamaszek Marc P. Renault Adi Rosén and Rob van Stee. 2016. Reordering buffer management with advice. J. Sched. (2016). To appear. Preliminary version in WAOA’13. Anna Adamaszek Marc P. Renault Adi Rosén and Rob van Stee. 2016. Reordering buffer management with advice. J. Sched. (2016). To appear. Preliminary version in WAOA’13.
3. Semi-online scheduling revisited
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献