%0 Report %T Characterizing the behavior of sparse algorithms on caches %+ Calculateurs Parallèles (CALCPAR) %A Temam, Olivier %A Jalby, William %N RR-1666 %I INRIA %8 1992 %D 1992 %Z Computer Science [cs]/Other [cs.OH]Reports %X 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. %G English %2 https://inria.hal.science/inria-00074891/document %2 https://inria.hal.science/inria-00074891/file/RR-1666.pdf %L inria-00074891 %U https://inria.hal.science/inria-00074891 %~ EC-PARIS %~ UNIV-RENNES1 %~ CNRS %~ INRIA %~ INSA-RENNES %~ INRIA-RENNES %~ IRISA %~ INRIA-RRRT %~ IRISA_SET %~ TESTALAIN1 %~ INRIA2 %~ UR1-HAL %~ LARA %~ UR1-MATH-STIC %~ UR1-UFR-ISTIC %~ TEST-UNIV-RENNES %~ TEST-UR-CSS %~ UNIV-RENNES %~ INRIA-RENGRE %~ INSA-GROUPE %~ UR1-MATH-NUM