Mostrar el registro sencillo del ítem

Hydra: Automatic algorithm exploration from linear algebra equations

hal.structure.identifierDepartment of Computer Science [UIUC] [UIUC]
dc.contributor.authorDUCHÂTEAU, Alexandre
hal.structure.identifierUniversity of Illinois at Urbana-Champaign [Urbana] [UIUC]
dc.contributor.authorPADUA, David
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
dc.contributor.authorBARTHOU, Denis
dc.date.accessioned2024-04-15T09:42:12Z
dc.date.available2024-04-15T09:42:12Z
dc.date.issued2013
dc.date.conference2013-02-23
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197664
dc.description.abstractEnHydra accepts an equation written in terms of operations on matrices and automatically produces highly efficient code to solve these equations. Processing of the equation starts by tiling the matrices. This transforms the equation into either a single new equation containing terms involving tiles or into multiple equations some of which can be solved in parallel with each other. Hydra continues transforming the equations using tiling and seeking terms that Hydra knows how to compute or equations it knows how to solve. The end result is that by transforming the equations Hydra can produce multiple solvers with different locality behavior and/or different parallel execution profiles. Next, Hydra applies empirical search over this space of possible solvers to identify the most efficient version. In this way, Hydra enables the automatic production of efficient solvers requiring very little or no coding at all and delivering performance approximating that of the highly tuned library routines such as Intel's MKL.
dc.language.isoen
dc.source.titleProceedings of the IEEE Conference on Code Generation and Optimization
dc.title.enHydra: Automatic algorithm exploration from linear algebra equations
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.pagepp.1-10
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleCode Generation and Optimization
bordeaux.countryCN
bordeaux.title.proceedingProceedings of the IEEE Conference on Code Generation and Optimization
bordeaux.conference.cityShenzhen
bordeaux.peerReviewedoui
hal.identifierhal-00920869
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2013-02-27
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00920869v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Proceedings%20of%20the%20IEEE%20Conference%20on%20Code%20Generation%20and%20Optimization&rft.date=2013&rft.spage=pp.1-10&rft.epage=pp.1-10&rft.au=DUCH%C3%82TEAU,%20Alexandre&PADUA,%20David&BARTHOU,%20Denis&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem