Advertisement

Competitive analysis of the on-line algorithms for multiple stacks systems

  • Been-Chian Chien
  • Rong-Jaye Chen
  • Wei-Pang Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

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

Competitive Ratio Online Algorithm Competitive Algorithm Request Sequence Future Request 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. L. Bentley and C. C. McGeoch, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Comm. ACM 28 (1985) 404–411.Google Scholar
  2. [2]
    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
  3. [3]
    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
  4. [4]
    D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, Reading, MA, 1973).Google Scholar
  5. [5]
    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
  6. [6]
    M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive Algorithms for Sever Problems, J. of Algorithms, 11 (1990) 208–230.CrossRefGoogle Scholar
  7. [7]
    D. D. Sleator and R. E. Tarjan, Amortized Efficiency of List Update and Paging Rules, Comm. ACM 28 (1985) 202–208.CrossRefGoogle Scholar
  8. [8]
    D. D. Sleator and R. E. Tarjan, Self-Adjusting Binary Search Trees, J. ACM 32 (1985) 652–686.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Been-Chian Chien
    • 1
  • Rong-Jaye Chen
    • 1
  • Wei-Pang Yang
    • 2
  1. 1.Institute of Computer Science and Information EngineeringNational Chiao Tung UniversityR.O.C.
  2. 2.Department of Computer and Information ScienceNational Chiao Tung UniversityHsinchuTaiwan, 30050, R.O.C.

Personalised recommendations