Competitive analysis of the on-line algorithms for multiple stacks systems
An on-line problem is one in which an algorithm must handle a sequence of requests, satisfying each request without knowledge of the future requests. A competitive algorithm is an on-line algorithm whose cost is bounded by the cost of any other algorithm, even the algorithm is an optimal off-line algorithm, multipling a constant. This paper discusses the algorithms used to manipulate the multiple stacks problem, which is one of the on-line problems. We find the optimal off-line algorithm first, then show that the Knuth's algorithm is not a competitive algorithm, but Garwick's algorithm is competitive when the number of stacks n is 2. Furthermore, the competitive ratio found here is a low bound if the Garwick's algorithm is also a competitive algorithm for n≥3.
KeywordsCompetitive Ratio Online Algorithm Competitive Algorithm Request Sequence Future Request
Unable to display preview. Download preview PDF.
- J. L. Bentley and C. C. McGeoch, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Comm. ACM 28 (1985) 404–411.Google Scholar
- A. Borodin, N. Linial, and M. Saks, An Optimal Online Algorithm for Metrical Task Systems, in Proceedings 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 373–382.Google Scholar
- B. C. Chien and W. P. Yang, An Amortized Analysis of Linear Hashing, National Computer Symposium, Taiwan, R.O.C. 1989, pp. 66–75.Google Scholar
- D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, Reading, MA, 1973).Google Scholar
- M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive Algorithms for On-line Problems, in Proceedings 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 322–333.Google Scholar