Accession Number : ADA323332

Title :   Storage Alternatives for Large Structured State Spaces.

Descriptive Note : Contractor rept.,

Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s) : Ciardo, Gianfranco ; Miller, Andrew S.

PDF Url : ADA323332

Report Date : JAN 1997

Pagination or Media Count : 23

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, and how solution algorithms based on Kronecker operators greatly benefit from these results. 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.

Descriptors :   *DATA BASES, *QUEUEING THEORY, MATHEMATICAL MODELS, ALGORITHMS, SYSTEMS ENGINEERING, PARAMETRIC ANALYSIS, DATA MANAGEMENT, COMPUTER COMMUNICATIONS, EXECUTIVE ROUTINES.

Subject Categories : Computer Programming and Software
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE