Characterizing the behavior of sparse algorithms on caches - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Characterizing the behavior of sparse algorithms on caches

Olivier Temam
  • Function : Author
  • PersonId : 830062

Abstract

While there are many studies on the locality of dense codes, few deal with the locality of sparse codes. Because of indirect addressing sparse codes exhibit irregular patterns of references. In this paper, the behavior on cache of one of the most frequent primitives SpMxV (Sparse Matrix-Vector multiply) is analyzed. A model of its references is built and then performance bottlenecks of SpMxV are analyzed using model and simulations. Main parameters are identified and their role is explained and quantified. Then, this analysis is used to discuss optimizations of SpMxV. Moreover a blocking technique which takes into account the specifics of sparse codes is proposed.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1666.pdf (1.24 Mo) Télécharger le fichier

Dates and versions

inria-00074891 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074891 , version 1

Cite

Olivier Temam, William Jalby. Characterizing the behavior of sparse algorithms on caches. [Research Report] RR-1666, INRIA. 1992. ⟨inria-00074891⟩
78 View
163 Download

Share

Gmail Facebook X LinkedIn More