Non-Stack Single-Pass Simulation

  • Rabin A. Sugumar
  • Santosh G. Abraham


The previous chapter dealt with stack-based single-pass simulation. Stack-based single-pass simulation permits the simulation of a range of cache configurations in a time and space efficient manner. All stack-based simulation algorithms maintain multiple caches in a stack, exploiting inclusion properties between caches. During simulation they do a sequential search down the stack examining, modifying and moving entries as appropriate. Stack-based single-pass simulation is elegant and efficient relative to performing the simulations one at a time. However, taking a step back we see that the essential idea exploited in stack-based single-pass simulation is one of reducing simulation effort by simulating multiple configurations together and exploiting relations between the configurations to reduce simulation effort. This idea may be exploited to develop efficient single-pass algorithms in situations where stack simulation is not applicable. Even in situations where stack simulation is applicable non-stack single-pass simulation algorithms can be more efficient by avoiding the sequential search of the stack. In this chapter we discuss single-pass simulation algorithms that are not stack-based.


Buffer Size Simulation Algorithm Cache Size Cache Line Small Buffer 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. M. Adeĺson-Veĺskii and E. M. Landis. An algorithm for the organization of information. Soviet Math. Doklady, 3:1259–1263, 1962.Google Scholar
  2. [2]
    B. T. Bennett and V. J. Kruskal. LRU stack processing. IBM J. of Research and Development, pages 353–357, July 1975.Google Scholar
  3. [3]
    C. G. Cassandras and S. G. Strickland. On-line sensitivity analysis of Markov chains. IEEE Trans, on Automatic Control, 34(l):76–86, jan 1989.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    M. D. Hill. Man page of tycho.Google Scholar
  5. [5]
    M. D. Hill and A. J. Smith. Evaluating associativity in CPU caches. IEEE Trans, on Computers, 38(12):1612–1630, December 1989.CrossRefGoogle Scholar
  6. [6]
    Y. C. Ho, M. A. Eyler, and T. T. Chien. A gradient technique for general buffer storage design in a production line. Int. J. Prod. Research, 17(6):557–580, 1979.CrossRefGoogle Scholar
  7. [7]
    R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(2):78–117, 1970.CrossRefGoogle Scholar
  8. [8]
    F. Olken. Efficient methods for calculating the success function of fixed space replacement policies. Technical Report LBL-12370, Lawrence Berkeley Laboratory, 1981.Google Scholar
  9. [9]
    T. R. Puzak. Analysis of Cache Replacement Algorithms. PhD thesis, University of Massachusetts, Amherst, 1985.Google Scholar
  10. [10]
    D. D. Sleator and R. E. Tarjan. Self adjusting binary search trees. J. of the ACM, 32(3):652–686, 1985.MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    R. A. Sugumar. Multi-Configuration Simulation Algorithms for the Evaluation of Computer Architecture Designs. PhD thesis, University of Michigan, 1993. Also available as Tech. Report CSE-TR-173-93, CSE Division, University of Michigan.Google Scholar
  12. [12]
    R. A. Sugumar and S. G. Abraham. Efficient simulation of caches under optimal replacement with applications to miss characterization. In Proc. ACM SIGMETRICS Conf., pages 24–35, 1993.Google Scholar
  13. [13]
    R. A. Sugumar and S. G. Abraham. Fast efficient simulation of write-buffer configurations. In Hawaii Intl. Conf. on Systems Sciences — Architecture Track, 1994.Google Scholar
  14. [14]
    R. A. Sugumar and S. G. Abraham. Set-associative cache simulation using generalized binomial trees. ACM Trans. on Computer Systems, 1995? Conditionally accepted pending minor revisions.Google Scholar
  15. [15]
    R. Suri. Perturbation analysis: The state of the art and research issues explained via the GI/G/1 queue. Proceedings of the IEEE, 77(1), jan 1989.Google Scholar
  16. [16]
    D. Thiebaut. On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio. IEEE Trans. on Computers, 38(7):1012–1026, July 1989.CrossRefGoogle Scholar
  17. [17]
    J. G. Thompson. Efficient analysis of Caching Systems. PhD thesis, University of California, Berkeley, 1987.Google Scholar
  18. [18]
    I. L. Traiger and D. R. Slutz. One pass techniques for the evaluation of memory hierarchies. Technical Report RJ 892, IBM, 1971.Google Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Rabin A. Sugumar
    • 1
  • Santosh G. Abraham
    • 2
  1. 1.Cray Research Inc.Chippewa FallsUSA
  2. 2.Hewlett-Packard LaboratoriesPalo AltoUSA

Personalised recommendations