Mostrar o rexistro simple do ítem

dc.contributor.authorAndrade, Diego
dc.contributor.authorArenaz Silva, Manuel
dc.contributor.authorFraguela, Basilio B.
dc.contributor.authorTouriño, Juan
dc.contributor.authorDoallo, Ramón
dc.date.accessioned2019-02-08T16:29:43Z
dc.date.available2019-02-08T16:29:43Z
dc.date.issued2007-04-03
dc.identifier.citationAndrade, D. , Arenaz, M. , Fraguela, B. B., Touriño, J. and Doallo, R. (2007), Automated and accurate cache behavior analysis for codes with irregular access patterns. Concurrency Computat.: Pract. Exper., 19: 2407-2423. doi:10.1002/cpe.1173es_ES
dc.identifier.issn1532-0626
dc.identifier.issn1532-0634
dc.identifier.urihttp://hdl.handle.net/2183/21698
dc.descriptionThis is the peer reviewed version of the following article: Andrade, D. , Arenaz, M. , Fraguela, B. B., Touriño, J. and Doallo, R. (2007), Automated and accurate cache behavior analysis for codes with irregular access patterns. Concurrency Computat.: Pract. Exper., 19: 2407-2423. doi:10.1002/cpe.1173, which has been published in final form at https://doi.org/10.1002/cpe.1173. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.es_ES
dc.description.abstract[Abstract] The memory hierarchy plays an essential role in the performance of current computers, so good analysis tools that help in predicting and understanding its behavior are required. Analytical modeling is the ideal base for such tools if its traditional limitations in accuracy and scope of application can be overcome. While there has been extensive research on the modeling of codes with regular access patterns, less attention has been paid to codes with irregular patterns due to the increased difficulty in analyzing them. Nevertheless, many important applications exhibit this kind of pattern, and their lack of locality make them more cache‐demanding, which makes their study more relevant. The focus of this paper is the automation of the Probabilistic Miss Equations (PME) model, an analytical model of the cache behavior that provides fast and accurate predictions for codes with irregular access patterns. The information requirements of the PME model are defined and its integration in the XARK compiler, a research compiler oriented to automatic kernel recognition in scientific codes, is described. We show how to exploit the powerful information‐gathering capabilities provided by this compiler to allow the automated modeling of loop‐oriented scientific codes. Experimental results that validate the correctness of the automated PME model are also presented.es_ES
dc.description.sponsorshipMinisterio de Educación y Ciencia; TIN2004-07797-C02es_ES
dc.description.sponsorshipXunta de Galicia; PGIDIT03TIC10502PRes_ES
dc.description.sponsorshipXunta de Galicia; PGIDT05PXIC10504PNes_ES
dc.language.isoenges_ES
dc.publisherJohn Wiley & Sons Ltd.es_ES
dc.relation.urihttps://doi.org/10.1002/cpe.1173es_ES
dc.subjectMemory hierarchyes_ES
dc.subjectCache behaviores_ES
dc.subjectPerformance predictiones_ES
dc.subjectIrregular access patternses_ES
dc.subjectChains ofrecurrenceses_ES
dc.titleAutomated and accurate cache behavior analysis for codes with irregular access patternses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessinfo:eu-repo/semantics/openAccesses_ES
UDC.journalTitleConcurrency and Computation: Practice & Experiencees_ES
UDC.volume19es_ES
UDC.issue18es_ES
UDC.startPage2407es_ES
UDC.endPage2423es_ES
dc.identifier.doi10.1002/cpe.1173


Ficheiros no ítem

Thumbnail

Este ítem aparece na(s) seguinte(s) colección(s)

Mostrar o rexistro simple do ítem