See this document in CiteSeerX!

Achieving Speedups for APL on an SIMD Distributed Memory Machine (1990)  (Make Corrections)  (5 citations)
Raymond Greenlaw, Lawrence Snyder
International Journal of Parallel Programming



  Home/Search   Context   Related

 
View or download:
armstrong.edu/~greenlaw/resear...apl.ps
armstrong.edu/greenlaw/researc...apl.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  armstrong.edu/~greenlaw/...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Context of citations to this paper:   More

.... that the second most common data movement operation in APL (an array subscripted array) is very expensive on parallel machines [10]. Budd describes an APL compiler that decomposes array operations into vector operations for execution on a vector processor [5] This fine...

...to the allocation. This is known as ZPL s WYSIWYG performance model [3] Arbitrary array indexing is difficult to parallelize efficiently [5]. For example, the following Fortran 90 statement A(i) A(j) is a simple assignment if the i th and j th elements of A reside on...

Cited by:   More
Achieving Robust Performance in Parallel Programming Languages - Lewis (2001)   (Correct)
Problem Space Promotion and Its Evaluation as a.. - Chamberlain, Lewis..   (Correct)
Regions: An Abstraction for Expressing Array Computation - Chamberlain, Lewis, Lin.. (1998)   (Correct)

Active bibliography (related documents):   More   All
0.7:   A Model Classifying Algorithms as Inherently Sequential with.. - Greenlaw (1992)   (Correct)
0.5:   Time Space Tradeoffs in Vector Algorithms for APL Functions - Budd (1994)   (Correct)
0.3:   Data Parallel Programming: A Survey and a Proposal for a New.. - Hammarlund, Lisper (1993)   (Correct)

Similar documents based on text:   More   All
0.6:   Generating an APL Font - Hohti, Kanerva   (Correct)
0.5:   On the Permutations of a Vector Obtainable through the.. - Henry Baker Jr   (Correct)
0.4:   Syntax Analysis - This Module Contains   (Correct)

Related documents from co-citation:   More   All
4:   ZPL's WYSIWYG performance model - Chamberlain, Choi et al. - 1998
4:   SIMPLE performance results in ZPL (context) - Lin, Snyder
4:   A Programming Language (context) - Iverson - 1962

BibTeX entry:   (Update)

R. Greenlaw and L. Snyder. Achieving speedups for APL on an SIMD distributed memory machine. International Journal of Parallel Programming, 19(2):111--127, April 1990. http://citeseer.ist.psu.edu/greenlaw90achieving.html   More

@article{ greenlaw90achieving,
    author = "Raymond Greenlaw and Lawrence Snyder",
    title = "Achieving speedups for {APL} on an {SIMD} distributed memory machine",
    journal = "International Journal of Parallel Programming",
    volume = "19",
    number = "2",
    pages = "111--127",
    year = "1990",
    url = "citeseer.ist.psu.edu/greenlaw90achieving.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
273   Can programming be liberated from the von Neumann style (context) - Backus - 1978
260   Validity of the single processor approach to achieving large.. (context) - Amdahl - 1967
134   Computational Aspects of VLSI (context) - Ullman - 1984
124   The cube connected cycles: A versatile network for parallel .. (context) - Preparata, Vuillemin - 1981
103   A Programming Language (context) - Iverson - 1962
93   Parallel processing with the perfect shuffle (context) - Stone - 1970
67   language for data parallel programming (context) - Rose, Steele et al. - 1987
21   array features for the connection machine computer system (context) - Albert, Knobe et al. - 1988
14   APL an Interactive Approach (context) - Gilman, Rose - 1976
9   ACM Transactions on Programming Languages and Systems (context) - Budd, compiler et al. - 1984
4   programming language for SIMD/MIMD parallelism (context) - Kuehn, Siegel et al. - 1985
4   Conversion of control dependencies to data dependencies (context) - Allen, Kennedy et al. - 1983
3   A note on the vector C language (context) - Li - 1986
2   The structure of an advanced vectorer for pipelined processo.. (context) - Kuck, Kuhn et al. - 1980
2   Some properties of APL programs (context) - Saal, Weis - 1975
1   Allocation strategies for APL on the chip computer (context) - Schaad - 1987
1   Technical Report PL (context) - Rosenblum, Fortran et al. - 1987
1   Technical Report SLAC Report (context) - Abrams, machine - 1970

Documents on the same site (http://www.students.armstrong.edu/~greenlaw/research/papers.html):   More
Breadth-Depth Search is P-complete - Greenlaw (1994)   (Correct)
A Model Classifying Algorithms as Inherently Sequential with.. - Greenlaw (1992)   (Correct)
Optimal Edge Ranking of Trees in Polynomial Time - Torre, Greenlaw, Schäffer (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC