Scheduling algorithms-by-blocks on small clusters
Impacto
Scholar |
Otros documentos de la autoría: Igual, Francisco; Quintana-Ortí, Gregorio; Van de Geijn, Robert A.
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7036
comunitat-uji-handle3:10234/8620
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1002/cpe.2842 |
Metadatos
Título
Scheduling algorithms-by-blocks on small clustersFecha de publicación
2012-03-28Editor
WileyISSN
1532-0626; 1532-0634Cita bibliográfica
IGUAL, Francisco D.; QUINTANA‐ORTÍ, Gregorio; GEIJN, Robert. Scheduling algorithms‐by‐blocks on small clusters. Concurrency and Computation: Practice and Experience, 2013, vol. 25, no 3, p. 367-384Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://onlinelibrary.wiley.com/doi/10.1002/cpe.2842/abstractPalabras clave / Materias
Resumen
The arrival of multicore architectures has generated an interest in reformulating dense matrix computations as algorithms-by-blocks, where submatrices are units of data and computations with those blocks are units of ... [+]
The arrival of multicore architectures has generated an interest in reformulating dense matrix computations as algorithms-by-blocks, where submatrices are units of data and computations with those blocks are units of computation. Rather than directly executing such an algorithm, a directed acyclic graph is generated at runtime that is then scheduled by a runtime system such as SuperMatrix. The benefit is a clear separation of concerns between the library and the heuristics for scheduling. In this paper, we show that this approach can be taken one step further using the same methodology and an ad hoc runtime to map algorithms-by-blocks to small clusters. With no change to the library code, and the application that uses it, the computational power of such small clusters can be utilized. An impressive performance on a number of small clusters is reported. As a proof of the flexibility of the solution, we report performance results on accelerated clusters based on graphics processors. We believe this to be a possible step towards programming many-core architectures, as demonstrated by a port of the solution to Intel's Single-chip Cloud Computer (Intel, Santa Clara, CA, USA). Copyright © 2012 John Wiley & Sons, Ltd. [-]
Publicado en
Concurrency and Computation: Practice and Experience, 2013, vol. 25, no 3Derechos de acceso
Copyright © 2012 John Wiley & Sons, Ltd.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- ICC_Articles [427]