Name
Abstract | ||
|---|---|---|
Automatic parallelization is usually believed to be less effective at exploiting implicit paralleism in sparse/irregular programs than in their dense/regular counterparts. However, not much is really known because there have been few research reports on this topic. In this work, we have studied the possibility of using an automatic parallelizing compiler to detect the parallelism in sparse/irregular programs. The study with a collection of sparse/irregular programs led us to some common loop patterns. Based on these patterns three new techniques were derived that produced good speedups when manually applied to our benchmark codes. More importantly, these parallelization methode can be implemented in a parallelizing compiler and can be applied automatically. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/3-540-49530-4_4 | Scientific Programming |
Keywords | DocType | Volume |
benchmark code,automatic parallelization,parallelizing compiler,automatic parallelizing compiler,implicit paralleism,irregular program,parallelization methode,irregular fortran programs,good speedup,common loop pattern,new technique | Conference | 7 |
Issue | ISBN | Citations |
3-4 | 3-540-65172-1 | 50 |
PageRank | References | Authors |
2.44 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuan Lin | 1 | 99 | 10.66 |
| David A. Padua | 2 | 4540 | 590.45 |