Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
Parallel programming: techniques and applications using networked workstations and parallel computers
Split: a flexible and efficient algorithm to vector-descriptor product
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
GTAexpress: A Software Package to Handle Kronecker Descriptors
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling
Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling
Performance Models For Master/Slave Parallel Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The key operation to obtain stationary and transient solutions of transition systems described by Kronecker structured formalisms is the Vector-Descriptor product. This operation is usually performed with shuffling operations and matrices aggregations to reduce the floating point multiplications inside iterative methods. Due to the flexibility of the Split method treating Kronecker product terms, it is a natural alternative to decompose descriptors within parallel environments. The main problem is to define the correct task size to assign to each node and also the shared memory size, since sending a small task per time can lead to a larger communication overhead. In this paper we are investigating data partitioning strategies for a parallel solution of transition systems obtained from Kronecker descriptors using the Split algorithm.