Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Storage alternatives for large structured state spaces

  • Conference paper
  • First Online:
Computer Performance Evaluation Modelling Techniques and Tools (TOOLS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1245))

  • 145 Accesses

Abstract

We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional technique based on a single search tree, we demonstrate how an approach based on multiple levels of search trees offers advantages in both memory and execution complexity. Further execution time improvements are obtained by exploiting the concept of “event locality”. We apply our technique to three large parametric models, and give detailed experimental results.

This research was partially supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-19480 and by the Center for Advanced Computing and Communication under Contract 96-SC-NSF-1011

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. In Proc. 4th Int. Conf. on Modelling Techniques and Tools for Performance Evaluation, pages 13–27, 1989.

    Google Scholar 

  2. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, 1996.

    Google Scholar 

  3. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Perf. Eval., 18(1):37–59, 1993.

    Article  Google Scholar 

  4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. The MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  5. D. E. Knuth. Sorting and Searching. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of William and Mary, 23187-8795, Williamsburg, VA, USA

    Gianfranco Ciardo & Andrew S. Miner

Authors
  1. Gianfranco Ciardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew S. Miner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Raymond Marie Brigitte Plateau Maria Calzarossa Gerardo Rubino

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciardo, G., Miner, A.S. (1997). Storage alternatives for large structured state spaces. In: Marie, R., Plateau, B., Calzarossa, M., Rubino, G. (eds) Computer Performance Evaluation Modelling Techniques and Tools. TOOLS 1997. Lecture Notes in Computer Science, vol 1245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022196

Download citation

  • DOI: https://doi.org/10.1007/BFb0022196

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63101-9

  • Online ISBN: 978-3-540-69131-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation