Memory Hierarchy Behavior Study during the Execution of Recursive Linear Algebra Library

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00154095" target="_blank" >RIV/68407700:21230/09:00154095 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Memory Hierarchy Behavior Study during the Execution of Recursive Linear Algebra Library

Original language description

For good performance of every computer program, good cache and TLB utilization is crucial. In numerical linear algebra libraries (such as BLAS or LAPACK), good cache utilization is achieved by explicit loop restructuring (mainly loop blocking), but thisrequires difficult memory pattern behavior analysis. In this paper, we represent the recursive implementation ("divide and conquer" approach) of some routines from numerical algebra libraries. This implementation leads to good cache and TLB utilization with no need to analyze the memory pattern behavior due to "natural" partition of data.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Acta Polytechnica

ISSN

1210-2709

e-ISSN

—

Volume of the periodical

48

Issue of the periodical within the volume

5/2008

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

8

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—