Article

Free access

The role of APL and J in high-performance computation

Author:

Robert BerneckyAuthors Info & Claims

APL '93: Proceedings of the international conference on APL

Pages 17 - 32

https://doi.org/10.1145/166197.166201

Published: 01 September 1993 Publication History

Abstract

Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited. Parallelism in algorithm design is difficult for those who think in von Neumann terms. Portability of programs and programming skills can only be achieved by hiding the underlying machine architecture from the user, yet this may impact performance on a specific host.APL, J, and other applicative array languages with adequately rich semantics can do much to solve these problems. The paper discusses the value of abstraction and semantic richness, performance issues, portability, potential degree of parallelism, data distribution, process creation, communication and synchronization, frequency of program faults, and clarity of expression. The BLAS are used as a basis for comparison with traditional supercomputing languages.

References

[1]

Philip Abrams. An APL Machine. PhD thesis, Stanford University, 1970.

Digital Library

[2]

j.R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence; to data dependence. In Proceedings of the Principles of Programming Languages Conference, 1983.

Digital Library

[3]

APL2 Programming: Language Reference. 1987. SH20-9227.

[4]

Jon Bentley. Programming pearls. Communications of the ACM, 20(8), July 1983.

[5]

Jon Bentley. Programming pearls. Communications of the A CM, 20(9), August 1983.

Digital Library

[6]

Robert Bernecky. Function arrays. ACM SIGAPL Quote Quad, 14(4), June 1984.

Digital Library

[7]

Robert Bernecky. APL: a prototyping language. A CM SIGAPL Quote Quad, 16(4), July 1986.

Digital Library

[8]

Robert Bernecky. An introduction to function rank. A CM SIGAPL Quote Quad, 18(2), December 1987.

Digital Library

[9]

Robert Bernecky. Fortran 90 arrays. ACM SIGPLAN Notices, 26(2), February 1991.

Digital Library

[10]

Robert Bernecky. Fortran 90 arrays. APL- CAM Journal, 13(4), October 1991. Originally appeared in ACM SIGPLAN Notices, 26(2), February 1991.

Digital Library

[11]

Robert Bernecky. Array morphology. ACM SIGAPL Quote Quad, 24(1), August 1993.

Digital Library

[12]

Robert Bernecky and R.K.W. Hui. Gerunds and representations. ACM SIGAPL Quote Quad, 21(4), July 1991.

Digital Library

[13]

Robert Bernecky and Kenneth E. Iverson. Operators and enclosed arrays. In APL Users Meeting 1980, I.P. Sharp Associates Limited, 1980.

[14]

Lloyd W. Campbell, editor. Fortran 88: A Proposed Revision of FORTRAN 77. ISO/IEC JTCI/SC22/WG5-N357, March 1989.

[15]

David Cann. Retire Fortran? A debate rekindled. Communications of the A CM, 35(8), August 1992.

Digital Library

[16]

M.J. Dayd6 and I.S. Duff. Use of parallel level 3 BLAS in LU factorization on three vector multiprocessors- the Alliant FX/80, the CRAY-2, and the IBM 3090VF. 1990 h~ternational Conference on Supercomputing, June 1990.

Digital Library

[17]

J.J. Dongarra, Jeremy Decroz, Sven Hammarlung, and Ian Duff. A set of level 3 basic linear algebra subprograms. A CM Transactions on Mathematical Software, 16(1 ), March 1990.

Digital Library

[18]

Roger K.W. Hui, Kenneth E. Iverson, and Eugene E. McDonnell. Tacit programming. ACM SIGAPL Quote Quad, 21 (4), August 1991.

Digital Library

[19]

John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kauffman, 1990.

Digital Library

[20]

Susan Flynn Hummel, Edith Schonberg, and Lawrence E. Flynn. Factoring: a method for scheduling parallel loops. Communications of the A CM, 35(8), August 1992.

Digital Library

[21]

Kenneth E. Iverson. A Programming Language. Wiley, 1962.

Digital Library

[22]

Kenneth E. Iverson. Programming in J. 1991.

[23]

Kenneth E. Iverson. A Dictionary of J. J version 5 edition, 1992.

[24]

McGraw J.R, S.K. Skedzielewski, S.J. Allen, R.R. Oldehoeft, J. Glauert, C. Kirkham, W. Noyce, and R. Thomas. SISAL: Streams and Iterations in a Single-Assignment Language, Language Reference Manual. Technical Report M-146, Revision 1, Lawrence Livermore National Laboratory, March 1985.

[25]

F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.

Digital Library

[26]

C.L. Lawson, R.J. Hanson, D.R. Kincaid, and F.T. Krogh. Basic linear algebra subroutines for FORTRAN usage. A CM Transactions on Mathematical Software, 5(3), September 1979.

Digital Library

[27]

D.B. McIntyre. Language as an intellectual tool: from hieroglyphics to APL. IBM Systems Journal, 30(4), 1991.

Digital Library

[28]

Eugene E. McDonnell and Kenneth E. Iverson. Phrasal forms. A CM SIGAPL Quote Quad, 19(4), August 1989.

Digital Library

[29]

M.V. Morreale and M. Van Der Meulen. Primitive Function Performance of APL2 Version 1 Release 3 (with SPE PL34409) on the IBM 3090/S Vector Facility. Technical Report Technical Bulletin No. GG66-3130-00, IBM Washington Systems Center, IBM Corporation, May 1989.

[30]

Alan J. Perlis. Programming with idioms in APL. A CM SIGAPL Quote Quad, 9(4), June 1979.

Digital Library

[31]

SHARP APL Reference Manual. Reuters Information Services (Canada) Limited, Toronto, Canada, 2nd edition, 1991.

[32]

SHARP APL Reference Manual. iverson Software Inc., 33 Major St., Toronto, Canada, 2nd edition, 1993.

[33]

Bob Smith. Nested arrays, operators, and fufictions. ACM SIGAPL Quote Quad, 12(1), September 1981.

Digital Library

[34]

Guy L. Steele Jr. High performance Fortran: status report. A CM SIGPLAN Notices, 28(1), January 1993.

Digital Library

[35]

Harold S. Stone. High-Performance Computer Architecture. Addison-Wesley, 1987.

Digital Library

[36]

David W. Wall. Limits of instruction-level parallelism. In Proceedings ofASPLOS, 1991.

Digital Library

[37]

R.G. Willhoft. Parallel expression in the APL2 language. IBM Systems Journal, 30(4), 1991.

Digital Library

Cited By

Imam SSarkar VLeibs DKessler P(2014)Exploiting Implicit Parallelism in Dynamic Array Programming LanguagesProceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming10.1145/2627373.2627374(1-7)Online publication date: 9-Jun-2014
https://dl.acm.org/doi/10.1145/2627373.2627374
Mougin PDucasse S(2003)OOPALACM SIGPLAN Notices10.1145/949343.94931238:11(65-77)Online publication date: 26-Oct-2003
https://dl.acm.org/doi/10.1145/949343.949312
Mougin PDucasse SCrocker RSteele G(2003)OOPALProceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications10.1145/949305.949312(65-77)Online publication date: 26-Oct-2003
https://dl.acm.org/doi/10.1145/949305.949312
Show More Cited By

Recommendations

The role of APL and J in high-performance computation

Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited. Parallelism in algorithm design is difficult for those who think in von ...
Compilation techniques for high-performance applicative computation
High-Performance Languages for Parallel Computing

For the first 10 years of parallel computing, no high-level software infrastructure was commercially available for parallel architectures, forcing users to adopt a programming paradigm similar to assembly-language programming. In the 1980s, research ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

APL '93: Proceedings of the international conference on APL

September 1993

325 pages

ISBN:0897916123

DOI:10.1145/166197

Editor:
Elena M. Anzalone

ACM SIGAPL APL Quote Quad Volume 24, Issue 1
Aug. 1993
316 pages
ISSN:0163-6006
DOI:10.1145/166198
Editor:
Elena M. Anzalone
Issue’s Table of Contents

Copyright © 1993 Author.

Sponsors

SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

APL93

Sponsor:

SIGAPL

APL93: International Conference on APL

August 15 - 19, 1993

Ontario, Toronto, Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
499
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)27

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Imam SSarkar VLeibs DKessler P(2014)Exploiting Implicit Parallelism in Dynamic Array Programming LanguagesProceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming10.1145/2627373.2627374(1-7)Online publication date: 9-Jun-2014
https://dl.acm.org/doi/10.1145/2627373.2627374
Mougin PDucasse S(2003)OOPALACM SIGPLAN Notices10.1145/949343.94931238:11(65-77)Online publication date: 26-Oct-2003
https://dl.acm.org/doi/10.1145/949343.949312
Mougin PDucasse SCrocker RSteele G(2003)OOPALProceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications10.1145/949305.949312(65-77)Online publication date: 26-Oct-2003
https://dl.acm.org/doi/10.1145/949305.949312
Emoto KHu ZKakehi KTakeichi M(2018)A compositional framework for developing parallel programs on two-dimensional arraysInternational Journal of Parallel Programming10.5555/1553837.155384135:6(615-658)Online publication date: 27-Dec-2018
https://dl.acm.org/doi/10.5555/1553837.1553841
Grelck CScholz S(2018)Merging compositions of array skeletons in SACParallel Computing10.1016/j.parco.2006.08.00332:7(507-522)Online publication date: 31-Dec-2018
https://dl.acm.org/doi/10.1016/j.parco.2006.08.003
Grelck C(2015)Single Assignment C (SAC)Central European Functional Programming School10.1007/978-3-030-28346-9_7(207-282)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-030-28346-9_7
Grelck C(2011)Single assignment C (SAC) high productivity meets high performanceProceedings of the 4th Summer School conference on Central European Functional Programming School10.1007/978-3-642-32096-5_5(207-278)Online publication date: 14-Jun-2011
https://dl.acm.org/doi/10.1007/978-3-642-32096-5_5
GRELCK CSCHOLZ S(2003)SAC — FROM HIGH-LEVEL PROGRAMMING WITH ARRAYS TO EFFICIENT PARALLEL EXECUTIONParallel Processing Letters10.1142/S012962640300137913:03(401-412)Online publication date: Sep-2003
https://doi.org/10.1142/S0129626403001379
Barghoorn MLattermann DKilsch D(2000)High performance computing through parallel processingProceedings of the international conference on APL-Berlin-2000 conference10.1145/570475.570479(32-34)Online publication date: 24-Jul-2000
https://dl.acm.org/doi/10.1145/570475.570479
Barghoorn M(2000)High performance computing through parallel processingACM SIGAPL APL Quote Quad10.1145/570440.57047930:4(32-34)Online publication date: 1-Jun-2000
https://dl.acm.org/doi/10.1145/570440.570479

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten