Advice Complexity and Barely Random Algorithms
Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were analyzed within this model. We observe some connections between advice complexity and randomization. Our special focus goes to barely random algorithms, i.e., randomized algorithms that use only a constant number of random bits, regardless of the input size. We adapt the results on advice complexity to obtain efficient barely random algorithms for both the job shop scheduling and the paging problem.
Furthermore, so far, it has not been investigated for job shop scheduling how good an online algorithm may perform when only using a very small (e.g., constant) number of advice bits. In this paper, we answer this question by giving both lower and upper bounds, and also improve the best known upper bound for optimal algorithms.
KeywordsCompetitive Ratio Online Algorithm Random Algorithm Physical Memory Page Fault
Unable to display preview. Download preview PDF.
- 3.Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online Algorithms with Advice. Technical Report 614. ETH Zurich, Department of Computer Science (2009)Google Scholar
- 6.Dobrev, S., Královič, R., Pardubská, D.: How much information about the future is needed? In: 34th Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008), pp. 247–258 (2008)Google Scholar
- 10.Komm, D., Královič, R.: Advice Complexity and Barely Random Algorithms. Technical Report 684. ETH Zurich, Department of Computer Science (2010)Google Scholar