OpenMP-based parallel algorithms for solving kronecker descriptors

A.M. De Lima, T. Webber, M.A.S. Netto, R.M. Czekster, C.A.F. De Rose, P. Fernandes

Research output: Chapter in Book/Published conference outputConference publication

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.
Original languageEnglish
Title of host publicationProceedings - 22nd International Symposium on Computer Architecture and High Performance Computing Workshops, SBAC-PADW 2010, 1st Workshop on Applications for Multi and Many Core Architectures, WAMMCA
PublisherIEEE
ISBN (Print)978-1-4244-8877-3
DOIs
Publication statusPublished - 29 Nov 2010

Fingerprint

Dive into the research topics of 'OpenMP-based parallel algorithms for solving kronecker descriptors'. Together they form a unique fingerprint.

Cite this