Name
Abstract | ||
|---|---|---|
The potential speedup for SIMD parallel implementations of APL programs is considered. Both analytical and (simulated) empirical studies are presented. The approach is to recognize that nearly 95% of the operators appearing in APL programs are either scalar primitive, reduction or indexing and so the performance of these operators gives a good estimate of the amount of speedup a full program might receive. Substantial speedups are demonstrated for these operators and the empirical evidence accords with the analytical estimates. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/BF01407833 | International Journal of Parallel Programming |
Keywords | Field | DocType |
achieving speedup,data parallel,simd computers.,parallel programming,memory machine,parallelism,apl,empirical evidence,empirical study | Computer science,Scalar (physics),Parallel computing,Search engine indexing,Distributed memory,SIMD,Simd computer,Operator (computer programming),Empirical research,Speedup | Journal |
Volume | Issue | ISSN |
19 | 2 | 0885-7458 |
Citations | PageRank | References |
6 | 0.83 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raymond Greenlaw | 1 | 142 | 18.56 |
| Lawrence Snyder | 2 | 6 | 0.83 |