Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/MC.2015.229 | Computer |
Keywords | Field | DocType |
Galois fields,Memory management,Parallel programming,Computer architecture,Software engineering,Computer graphics,Scalability,Irregular algorithms,Runtime,Large-scale systems | Finite field,Programming paradigm,Computer science,Parallel computing,Algorithm,Thread (computing),Graph analytics,Memory management,Scaling,Computer graphics,Scalability | Journal |
Volume | Issue | ISSN |
48 | 8 | 0018-9162 |
Citations | PageRank | References |
5 | 0.44 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Lenharth | 1 | 456 | 19.94 |
| Keshav Pingali | 2 | 3056 | 256.64 |