Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was partly supported by National Science Council of Taiwan, R.O.C. under contract: NSC81-0408-E009-19(1991).
Preview
Unable to display preview. Download preview PDF.
References
J. L. Bentley and C. C. McGeoch, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Comm. ACM 28 (1985) 404–411.
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.
B. C. Chien and W. P. Yang, An Amortized Analysis of Linear Hashing, National Computer Symposium, Taiwan, R.O.C. 1989, pp. 66–75.
D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, Reading, MA, 1973).
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.
M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive Algorithms for Sever Problems, J. of Algorithms, 11 (1990) 208–230.
D. D. Sleator and R. E. Tarjan, Amortized Efficiency of List Update and Paging Rules, Comm. ACM 28 (1985) 202–208.
D. D. Sleator and R. E. Tarjan, Self-Adjusting Binary Search Trees, J. ACM 32 (1985) 652–686.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chien, BC., Chen, RJ., Yang, WP. (1992). Competitive analysis of the on-line algorithms for multiple stacks systems. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_60
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive