Scaling Runtimes for Irregular Algorithms to Large-Scale NUMA Systems.

The Galois system can automatically parallelize irregular algorithms written in a serial programming model and execute them efficiently on nonuniform memory access (NUMA) machines. Experimental results for five complex irregular algorithms show that the system scales up to 420× on large NUMA systems...

Descripción completa

Detalles Bibliográficos
Publicado en:	Computer (00189162) Vol. 48; no. 8; pp. 35 - 45
Autores principales:	Lenharth, Andrew, Pingali, Keshav
Formato:	Artículo
Publicado:	IEEE Aug2015
Materias:	Galois theory Non-uniform memory access Computer storage devices Computer input-output equipment Algorithms
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	The Galois system can automatically parallelize irregular algorithms written in a serial programming model and execute them efficiently on nonuniform memory access (NUMA) machines. Experimental results for five complex irregular algorithms show that the system scales up to 420× on large NUMA systems at 512 threads.