Detail publikace

Cache Efficient Implementation for Block Matrix Operations

POLOK, L. ILA, V. SMRŽ, P.

Originální název

Cache Efficient Implementation for Block Matrix Operations

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

Efficiently manipulating and operating on block matrices can be beneficial in many applications, among others those involving iteratively solving nonlinear systems. These types of problems consist of repeatedly assembling and solving sparse linear systems. In the case of very large systems, without a careful manipulation of the corresponding matrices, solving can become very time consuming. This paper proposes a memory storage scheme convenient for both, numeric and structural matrix modification and, at the same time, allowing efficient arithmetic operation. This scheme was used in the implementation of a simple BLAS-like library. The advantage of the new scheme is demonstrated through exhaustive tests on the popular University of Florida Sparse Matrix Collection. Furthermore, this library was used in solving several nonlinear graph optimization problems.

Klíčová slova

block matrix, high performance, sparse BLAS, nonlinear least squares

Autoři

POLOK, L.; ILA, V.; SMRŽ, P.

Rok RIV

2013

Vydáno

7. 4. 2013

Nakladatel

Association for Computing Machinery

Místo

San Diego

ISBN

1-56555-350-0

Kniha

Proceedings of the 21st High Performance Computing Symposium (HPC'13)

Strany od

698

Strany do

706

Strany počet

8

URL

http://dl.acm.org/citation.cfm?id=2499972

BibTex

@inproceedings{BUT103462,
  author="Lukáš {Polok} and Viorela Simona {Ila} and Pavel {Smrž}",
  title="Cache Efficient Implementation for Block Matrix Operations",
  booktitle="Proceedings of the 21st High Performance Computing Symposium (HPC'13)",
  year="2013",
  pages="698--706",
  publisher="Association for Computing Machinery",
  address="San Diego",
  isbn="1-56555-350-0",
  url="http://dl.acm.org/citation.cfm?id=2499972"
}