000156532 001__ 156532 000156532 005__ 20251017144553.0 000156532 0247_ $$2doi$$a10.3390/math8020184 000156532 0248_ $$2sideral$$a117328 000156532 037__ $$aART-2020-117328 000156532 041__ $$aeng 000156532 100__ $$0(orcid)0000-0002-4155-7687$$aPedro-Zapater, Alba 000156532 245__ $$aIdeal and predictable hit ratio for matrix transposition in data caches 000156532 260__ $$c2020 000156532 5060_ $$aAccess copy available to the general public$$fUnrestricted 000156532 5203_ $$aMatrix transposition is a fundamental operation, but it may present a very low and hardly predictable data cache hit ratio for large matrices. Safe (worst-case) hit ratio predictability is required in real-time systems. In this paper, we obtain the relations among the cache parameters that guarantee the ideal (predictable) data hit ratio assuming a Least-Recently-Used (LRU) data cache. Considering our analytical assessments, we compare a tiling matrix transposition to a cache oblivious algorithm, modified with phantom padding to improve its data hit ratio. Our results show that, with an adequate tile size, the tiling version results in an equal or better data hit ratio. We also analyze the energy consumption and execution time of matrix transposition on real hardware with pseudo-LRU (PLRU) caches. Our analytical hit/miss assessment enables the usage of a data cache for matrix transposition in real-time systems, since the number of misses in the worst case is bound. In general and high-performance computation, our analysis enables us to restrict the cache resources devoted to matrix transposition with no negative impact, in order to reduce both the energy consumption and the pollution to other computations. 000156532 536__ $$9info:eu-repo/grantAgreement/ES/AEI-FEDER/TIN2016-76635-C2-1-R$$9info:eu-repo/grantAgreement/ES/DGA/T58-17R$$9info:eu-repo/grantAgreement/ES/MEC/FPU14-02463 000156532 540__ $$9info:eu-repo/semantics/openAccess$$aby$$uhttps://creativecommons.org/licenses/by/4.0/deed.es 000156532 590__ $$a2.258$$b2020 000156532 591__ $$aMATHEMATICS$$b24 / 330 = 0.073$$c2020$$dQ1$$eT1 000156532 592__ $$a0.495$$b2020 000156532 593__ $$aMathematics (miscellaneous)$$c2020$$dQ2 000156532 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion 000156532 700__ $$aRodríguez, Clemente 000156532 700__ $$0(orcid)0000-0003-1550-735X$$aSegarra, Juan$$uUniversidad de Zaragoza 000156532 700__ $$0(orcid)0000-0002-4031-5651$$aGran Tejero, Rubén$$uUniversidad de Zaragoza 000156532 700__ $$0(orcid)0000-0002-5976-1352$$aViñals-Yúfera, Víctor$$uUniversidad de Zaragoza 000156532 7102_ $$15007$$2035$$aUniversidad de Zaragoza$$bDpto. Informát.Ingenie.Sistms.$$cÁrea Arquit.Tecnología Comput. 000156532 773__ $$g8, 2 (2020), 184 [23 pp.]$$pMathematics (Basel)$$tMathematics$$x2227-7390 000156532 8564_ $$s588325$$uhttps://zaguan.unizar.es/record/156532/files/texto_completo.pdf$$yVersión publicada 000156532 8564_ $$s2522736$$uhttps://zaguan.unizar.es/record/156532/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada 000156532 909CO $$ooai:zaguan.unizar.es:156532$$particulos$$pdriver 000156532 951__ $$a2025-10-17-14:12:23 000156532 980__ $$aARTICLE