Scaling runtimes for irregular algorithms to large-scale NUMA systems

A Lenharth, K Pingali - Computer, 2015 - ieeexplore.ieee.org
Computer, 2015ieeexplore.ieee.org
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.
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results