About: Recursive Implementation of High Performance Numerical Algebra Library     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • For a good performance of every computer program, the efficient cache utilization is crucial. In numerical algebra libraries (such as BLAS or LAPACK) is the good cache utilization achieved by the explicit loop restructuring. It includes loop unrolling-and-jam which increase the FPU pipeline utilization in the innermost loop, loop blocking (that is why we called these codes shortly blocked) and loop interchange to maximize the a cache hit ratio. After application of these transformations, these codes are divided into two parts. Outer loops are \%22out-cache\%22, inner loops are \%22in-cache\%22. Codes have almost the same performance independently on the amount of data, but all these code transformations require the difficult cache behavior analysis. In this paper, we represent the recursive implementation of some routines from the numerical algebra library. This implementation leads to cache-sensitive codes due to the \%22natural\%22 partition of data without need to analyze the cache behavior.
  • For a good performance of every computer program, the efficient cache utilization is crucial. In numerical algebra libraries (such as BLAS or LAPACK) is the good cache utilization achieved by the explicit loop restructuring. It includes loop unrolling-and-jam which increase the FPU pipeline utilization in the innermost loop, loop blocking (that is why we called these codes shortly blocked) and loop interchange to maximize the a cache hit ratio. After application of these transformations, these codes are divided into two parts. Outer loops are \%22out-cache\%22, inner loops are \%22in-cache\%22. Codes have almost the same performance independently on the amount of data, but all these code transformations require the difficult cache behavior analysis. In this paper, we represent the recursive implementation of some routines from the numerical algebra library. This implementation leads to cache-sensitive codes due to the \%22natural\%22 partition of data without need to analyze the cache behavior. (en)
  • Zprava popisuje rekurzivní implementace vysoce vykonné knihovny pro numerickou algebru, která narozdíl od klasických numerických knihoven (jako BLAS nebo LAPACK) nevyžaduje složitou úpravu cyklů ani analytický model chování skrytých pamětí. Vysoká úcinnost použití skrytých pamětí je zde dána rozdělením dat. (cs)
Title
  • Rekurzivní implementace vysoce vykonné knihovny pro numerickou algebru (cs)
  • Recursive Implementation of High Performance Numerical Algebra Library
  • Recursive Implementation of High Performance Numerical Algebra Library (en)
skos:prefLabel
  • Rekurzivní implementace vysoce vykonné knihovny pro numerickou algebru (cs)
  • Recursive Implementation of High Performance Numerical Algebra Library
  • Recursive Implementation of High Performance Numerical Algebra Library (en)
skos:notation
  • RIV/68407700:21110/06:03114523!RIV07-AV0-21110___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IBS3086102)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 496753
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21110/06:03114523
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • High Performance; cache utilization; numerical algebra library; recursive implementation (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...i/riv/kodPristupu
http://linked.open...ontrolniKodProRIV
  • [3037BDA85ABD]
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...n/vavai/riv/nosic
  • neuvedeno
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Šimeček, Ivan
https://schema.org/isbn
  • 80-01-03439-9
http://localhost/t...ganizacniJednotka
  • 21110
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software