The Community for Technology Leaders
2010 22nd International Symposium on Computer Architecture and High Performance Computing Workshops (2010)
Petropolis, Brazil
Oct. 27, 2010 to Oct. 30, 2010
ISBN: 978-0-7695-4276-8
pp: 55-60
ABSTRACT
Numerical analysis of Markovian models is relevant for performance evaluation and probabilistic analysis of systems' behavior from several fields such as Bioinformatics, Economics, and Engineering. These models can be represented in a compact fashion using Kronecker algebra. The Vector-Descriptor Product is the key operation to obtain stationary solutions of Kronecker-based descriptors. Due to its complexity, the numerical algorithms are usually CPU intensive, requiring alternatives such as data partitioning in order to produce results in less time. This paper proposes three OpenMP-based parallel implementations for solving descriptors to be deployed on shared-memory machines. We evaluated the implementations in a multi-core machine and obtained a speed-up near to eight when using eight cores with Intel Hyper-Threading technology.
INDEX TERMS
Kronecker Descriptors, Parallel Algorithms, OpenMP
CITATION

C. A. Rose, A. M. Lima, R. M. Czekster, T. Webber, M. A. Netto and P. Fernandes, "OpenMP-based Parallel Algorithms for Solving Kronecker Descriptors," 2010 22nd International Symposium on Computer Architecture and High Performance Computing Workshops(SBAC-PADW), Petropolis, Brazil, 2010, pp. 55-60.
doi:10.1109/SBAC-PADW.2010.13
96 ms
(Ver 3.3 (11022016))