Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
DOI10.1016/j.jpdc.2012.02.001zbMath1242.65008OpenAlexW2054608335MaRDI QIDQ433452
Marco A. S. Netto, Ricardo M. Czekster, Cesar A. F. De Rose, Antonio M. Lima, Paulo Fernandes, Thais Webber
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.02.001
performance evaluationparallel algorithmsOpenMPscientific computingnumerical softwareMarkovian modelsKronecker descriptorsNUMA machines
Probabilistic models, generic numerical methods in probability and statistics (65C20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05)
Uses Software
Cites Work
- A high-performance, portable implementation of the MPI message passing interface standard
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- A parallel GMRES version for general sparse matrices
- Distributed disk-based algorithms for model checking very large Markov chains
- Efficient descriptor-vector multiplications in stochastic automata networks
- Kronecker products and shuffle algebra
- A highly parallel Black–Scholes solver based on adaptive sparse grids
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors