Skip to main content
Log in

Achieving speedups for APL on an SIMD distributed memory machine

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. J. Kuck, R. H. Kuhn, B. Leasure, and M. Wolfe, The structure of an advanced vectorer for pipelined processors. In4th Int. Computer Software and Application Conf., IEEE, pp. 709–715 (1980).

  2. J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren, Conversion of control dependencies to data dependencies. InProc. 10th ACM Symp. on the Principles of Programming Languages, ACM, pp. 177–189 (1983).

  3. J. Kuehn and H. Siegel, Extensions to the C programming language for SIMD/MIMD Parallelism. InProc. Int. Conf. on Parallel Processing, IEEE, pp. 232–235 (1985).

  4. K. Li, A note on the vector C language,SIGPLAN Notices 21(1):49–57 (January 1986).

    Google Scholar 

  5. J. Rose and G. Steele, C: An extended C language for data parallel programming, Technical Report PL87-5, Thinking Machines, Cambridge, Massachusetts (May 1987).

  6. K. E. Iverson,A Programming Language. John Wiley and Sons, New York (1962).

    Google Scholar 

  7. T. Budd, An APL compiler for a vector processor,ACM Transactions on Programming Languages and Systems 6(3):297–313 (July 1984).

    Google Scholar 

  8. E. Albert, K. Knobe, J. D. Lukas, and G. L. Steele,Compiling FORTAN 8x array features for the connection machine computer system. InSIGPLAN Symp. on Parallel Programming: Experience with, Applications, Languages, and Systems, ACM 23(9):42–56 (September 1988).

  9. P. Rosenblum, Using the Fortran 8x style of programming, Technical Report PL87-7, Thinking Machines, Cambridge, Massachusetts (September 1987).

  10. J. Schaad, Allocation strategies for APL on the chip computer, TR 87-03-06, University of Washington (March 1987).

  11. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974).

    Google Scholar 

  12. J. Ullman,Computational Aspects of VLSI, Computer Science Press (1984).

  13. L. Gilman and A. Rose,APL an Interactive Approach. Wiley (1976).

  14. H. Saal and Z. Weis, Some properties of APL programs,APL Conf. Proc. Pisa, Italy, pp. 292–275 (June 1975).

  15. P. Abrams, An APL machine, Technical Report SLAC Report 114, Stanford University (1970).

  16. H. Stone, Parallel processing with the perfect shuffle,IEEE Trans. on Computers C-20(2):153–161 (February 1970).

    Google Scholar 

  17. F. Preparata and J. Vuillemin, The cube connected cycles: A versatile network for parallel computation,CACM 24(5):300–309 (May 1981).

    Google Scholar 

  18. J. Backus, Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,Communications of the ACM 21(8):613–641 (1978).

    Google Scholar 

  19. G. M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities. InAFIPS Conf. AFIPS 30:483–485 (1967).

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research has been funded by the Office of Naval Research Contract No. N00014-86-K-0264 and the National Science Foundation Grant No. DCR 8416878.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Greenlaw, R., Snyder, L. Achieving speedups for APL on an SIMD distributed memory machine. Int J Parallel Prog 19, 111–127 (1990). https://doi.org/10.1007/BF01407833

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01407833

Key Words

Navigation