1990
DOI: 10.1007/bf01407833
|View full text |Cite
|
Sign up to set email alerts
|

Achieving speedups for APL on an SIMD distributed memory machine

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 ana… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1997
1997
2007
2007

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 10 publications
(4 reference statements)
0
2
0
Order By: Relevance
“…Arbitrary mTay indexing is difficult to pandlelize effiuianfly [5]. For example, the following High Perfonnance Fortran (HPF) [7] statement peffu, a communication.…”
Section: Zpl: a Practical Parallel Region-based Lankuakementioning
confidence: 99%
“…Arbitrary mTay indexing is difficult to pandlelize effiuianfly [5]. For example, the following High Perfonnance Fortran (HPF) [7] statement peffu, a communication.…”
Section: Zpl: a Practical Parallel Region-based Lankuakementioning
confidence: 99%
“…hardware, including low level software and firmware) and applications (including high level portals etc.) which can effectively utilize the extremely different execution environments 1 , and actually enable a seamless integration of different kinds of Grid-enabled equipment, including inter alias scientific instruments, experimentation and production tools, mobile units of all kinds etc. into one Grid system.…”
Section: Introductionmentioning
confidence: 99%