Abstract
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and communication networks. One common approach is the state-space-based technique, which, starting from a high-level model, uses depth-first search to generate both a description of every possible state of the model and the dynamics of the transitions between them. However, these state spaces, besides being very irregular in structure, are subject to a combinatorial explosion, and can thus become extremely large. In the interest therefore of utilizing both the large memory capacity and the greater computational performance of modern multiprocessors, we are interested in implementing parallel algorithms for the generation and solution of these problems. In this paper we describe the techniques we use to generate the state space of a stochastic Petri-net model using shared-memory multiprocessors. We describe some of the problems encountered and our solutions, in particular the use of modified B-trees as a data structure for the parallel search process. We present results obtained from experiments on two different shared-memory machines.
Preview
Unable to display preview. Download preview PDF.
References
S. Allmaier, M. Kowarschik, and G. Horton. State space construction and steadystate solution of GSPNs on a shared-memory multiprocessor. In Proc. IEEE Int. Workshop Petri Nets and Performance Models (PNPM '97), St. Malo, France, 1997. IEEE Comp. Soc. Press. To appear.
G. Balbo. On the success of stochastic Petri nets. In Proc. IEEE Int. Workshop on Petri Nets and Performance Models (PNPM '95), pages 2–9, Durham, NC, 1995. IEEE Comp. Soc. Press.
R. Bayer and M. Schkolnick. Concurrency of operations on B-trees. Acta Informatica, 9:1–21, 1977.
G. Ciardo, J. Gluckman, and D. Nicol. Distributed state-space generation of discrete-state stochastic models. Technical Report 198233, ICASE, NASA Langley Research Center, Hampton, VA, 1995.
D. Comer. The ubiquitous B-tree. Computing Surveys, 11(2):121–137, 1979.
L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Symp. Foundations of Computer Science, pages 8–21, 1978.
M. Ajmone Marsan, G. Balbo, and G. Conte. Performance models of multiprocessor systems. MIT Press, 1986.
M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with generalized stochastic Petri nets. Wiley, Series in Parallel Computing, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allmaier, S.C., Horton, G. (1997). Parallel shared-memory state-space exploration in stochastic modeling. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-63138-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63138-5
Online ISBN: 978-3-540-69157-0
eBook Packages: Springer Book Archive