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...

Full description

Bibliographic Details

Published in:	Computer (00189162) Vol. 48; no. 8; pp. 35 - 45
Main Authors:	Lenharth, Andrew, Pingali, Keshav
Format:	Article
Published:	IEEE Aug2015
Subjects:	Galois theory Non-uniform memory access Computer storage devices Computer input-output equipment Algorithms
Online Access:	View this record in EBSCOhost