Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
From MaRDI portal
(Redirected from Publication:433452)
Recommendations
- Analyzing Markov chains using Kronecker products. Theory and applications
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
- Kronecker modeling and analysis of multidimensional Markovian systems
- Euro-Par 2004 Parallel Processing
- A structural approach for modelling performance of systems using skeletons
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- A high-performance, portable implementation of the MPI message passing interface standard
- A highly parallel Black--Scholes solver based on adaptive sparse grids
- A parallel GMRES version for general sparse matrices
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- A symbolic out-of-core solution method for Markov models
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- Distributed disk-based algorithms for model checking very large Markov chains
- Efficient descriptor-vector multiplications in stochastic automata networks
- Kronecker products and shuffle algebra
- Parallel iterative methods for sparse linear systems
- Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
This page was built for publication: Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433452)