Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems

Authors:
Anne Benoit;Brigitte Plateau;William J. Stewart
Affiliations:
Laboratoire ID-IMAG - Ensimag, antenne de Montbonnot, Montbonnot St Martin, France and LIP, Ecole Normale Superieure de Lyon, Lyon Cedex, France;Laboratoire ID-IMAG - Ensimag, antenne de Montbonnot, Montbonnot St Martin, France;Department of Computer Science, North Carolina State University, Raleigh, NC
Venue:
Future Generation Computer Systems - Systems performance analysis and evaluation
Year:
2006

Citing 19
Cited 1

Introduction to queueing networks

Introduction to queueing networks
Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space

Performance Evaluation
Numerical Analysis of Superposed GSPNs

IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Efficient descriptor-vector multiplications in stochastic automata networks

Journal of the ACM (JACM)
An efficient disk-based tool for solving large Markov models

Performance Evaluation - Special issue on tools for performance evaluation
Modelling with Generalized Stochastic Petri Nets

ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents

Performance Evaluation
Modeling Using Stochastic Reward Nets

MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
On Combining Functional Verification and Performance Evaluation Using CADP

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Reachability Analysis Based on Structured Representations

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models

INFORMS Journal on Computing
"On-the-fly" Soltuion Techniques for Stochastic Petri Nets and Extensions

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Hierarchical Structuring of Superposed GSPNs

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
A Data Structure for the Efficient Kronecker Solution of GSPNs

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Memory-Efficient Kronecker Algorithms with Applications to the Modelling of Parallel Systems

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Efficient Solution of GSPNs Using Canonical Matrix Diagrams

PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
On the benefits of using functional transitions and Kronecker algebra

Performance Evaluation

Performance modelling and Markov chains

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of stochastic automata. The tensor structure inherently involves a product state space but, inside this product state space, the actual reachable state space can be much smaller. For such cases, we propose an improvement of the standard numerical algorithm, the so-called "shuffle algorithm", which necessitates only vectors of the size of the actual state space. With this contribution, numerical algorithms based on tensor products can now handle larger models.