Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models

We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the ``actual'''' state space instead of the ``potential'''' state space.

[1]  Marc Davio,et al.  Kronecker products and shuffle algebra , 1981, IEEE Transactions on Computers.

[2]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[3]  Sergio Pissanetzky,et al.  Sparse Matrix Technology , 1984 .

[4]  Brigitte Plateau,et al.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS '85.

[5]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[6]  Debasis Mitra,et al.  A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius , 1986, JACM.

[7]  Brigitte Plateau,et al.  Stochastic Automata Network For Modeling Parallel Systems , 1991, IEEE Trans. Software Eng..

[8]  Kishor S. Trivedi,et al.  Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets , 1993 .

[9]  Susanna Donatelli,et al.  Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space , 1993, Perform. Evaluation.

[10]  Giovanni Chiola.  On the structural and behavioural characterization of P/T nets , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[11]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[12]  Peter Buchholz,et al.  A class of hierarchical queueing networks and their analysis , 1994, Queueing Syst. Theory Appl..

[13]  Susanna Donatelli,et al.  Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution , 1994, Application and Theory of Petri Nets.

[14]  Peter Kemper.  Reachability Analysis Based on Structured Representations , 1996, Application and Theory of Petri Nets.

[15]  Peter Kemper.  Numerical Analysis of Superposed GSPNs , 1996, IEEE Trans. Software Eng..

[16]  G. Ciardo,et al.  ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS , 1996 .

[17]  Gianfranco Ciardo,et al.  SMART: simulation and Markovian analyzer for reliability and timing , 1996, Proceedings of IEEE International Computer Performance and Dependability Symposium.

[18]  William H. Sanders,et al.  "On-the-fly" solution techniques for stochastic Petri nets and extensions , 1997, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models.

[19]  Peter Kemper.  Superposition of generalized stochastic Petri nets and its impact on performance analysis , 1997 .

[20]  William H. Sanders,et al.  An Efficient Disk-Based Tool for Solving Very Large Markov Models , 1997, Computer Performance Evaluation.

[21]  Gianfranco Ciardo,et al.  Storage Alternatives for Large Structured State Spaces , 1997, Computer Performance Evaluation.

[22]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[23]  William H. Sanders,et al.  "On-the-Fly'' Solution Techniques for Stochastic Petri Nets and Extensions , 1998, IEEE Trans. Software Eng..

[24]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.