Article

Free access

Rank vs depth for array partitioning

Author:

J. Philip BenkardAuthors Info & Claims

APL '84: Proceedings of the international conference on APL

Pages 33 - 39

https://doi.org/10.1145/800058.801073

Published: 01 June 1984 Publication History

PDF eReader

Abstract

In some applications a subset of the dimensions of an array is used to define a framework which holds instances of cells defined by the complementary subset. A rank four array might be viewed as a page containing several rows of graphs. This structure could be used to apply a rotate function to each of the graphs. Existing proposals to implement a general scheme of program controlled distribution of functions over data arrays are compared. Nested arrays are suggested as the preferred technique. The analogy between the EACH operator and the ENCLOSE function in APL2/NARS leads to remarks on arrays of functions. In that context function distribution becomes a special case of scalar extension.

References

[1]

J. P. Benkard, "Nonpositional Indexing for a Relational Data Base", APL Quote Quad, Vol. 13, No. 1 (September 1982), pp. 32-39.

Digital Library

Google Scholar

[2]

J. P. Benkard, "Valence and Precedence in APL Extensions", APL Quote Quad, Vol. 13, No. 3 (March 1983), pp. 233-242.

Digital Library

Google Scholar

[3]

J. P. Benkard, "Syntactic Experiments with Arrays of Functions and Operators", these Proceedings.

Google Scholar

[4]

J. A. Brown, private conversations.

Google Scholar

[5]

J. D. Bunda and J. A. Gerth, "APL Two by Two - Syntax Analysis by Pairwise Reduction", these Proceedings.

Google Scholar

[6]

C. M. Cheney, Nested Arrays Reference Manual, STSC Inc., 1981.

Google Scholar

[7]

Ziad Ghandour and Jorge Mezei, "General Arrays, Operators, and Functions", IBM J. Res. Dev., Vol 18, No 4 (July 1973), pp. 335-352.

Digital Library

Google Scholar

[8]

IBM Corporation, APL2 Language Manual, Form No. SB21-3015.

Google Scholar

[9]

K. E. Iverson, Rationalized APL, Sharp Research Reports, No 1.

Google Scholar

[10]

J. T. Kajiya, "Designing and Implementing an Array Theory Incorporating Abstract Datatypes", APL Quote Quad, Vol. 13, No. 3 (March 1983), pp. 291-296.

Digital Library

Google Scholar

[11]

P. G. Lowney, Carrier Arrays: An Extension to APL, Yale Ph.D. thesis, May 1983, Research Report 256.

Digital Library

Google Scholar

[12]

Trenchard More, Jr., "Axioms and Theorems for a Theory of Arrays", IBM J. Res. Dev., Vol. 17, No. 2 (March 1973), pp. 135-175.

Digital Library

Google Scholar

Cited By

View all

Landaeta D(1987)The theory of function arraysProceedings of the international conference on APL10.1145/55626.55656(223-229)Online publication date: 1-Dec-1987
https://dl.acm.org/doi/10.1145/55626.55656
Landaeta D(1987)The theory of function arraysACM SIGAPL APL Quote Quad10.1145/377719.5565618:2(223-229)Online publication date: 1-Dec-1987
https://dl.acm.org/doi/10.1145/377719.55656
Brown JKallin S(1984)Function assignment and arrays of functionsProceedings of the international conference on APL10.1145/800058.801080(81-84)Online publication date: 11-Jun-1984
https://dl.acm.org/doi/10.1145/800058.801080
Show More Cited By

Index Terms

Rank vs depth for array partitioning
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Linear algebra algorithms
2. Information systems
  1. Information storage systems
    1. Record storage systems

Recommendations

Rank vs depth for array partitioning

In some applications a subset of the dimensions of an array is used to define a framework which holds instances of cells defined by the complementary subset. A rank four array might be viewed as a page containing several rows of graphs. This structure ...
Dynamic partitioning for array languages

The classical process of partitioning an array into subarrays is extended to a more useful array language operation. Various modes of partitioning are defined for different types of arrays, so that subarrays may vary over the original array in a nearly ...
L-shaped coprime array structures for DOA estimation
Abstract
This paper proposes a new sparse array geometry for 2-D (azimuth and elevation) direction-of-arrival (DOA) estimation based on coprime sampling. The proposed array structure is L-shaped coprime array (LCA) whose each portion is one dimensional ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

APL '84: Proceedings of the international conference on APL

June 1984

391 pages

ISBN:0897911377

DOI:10.1145/800058

Chairman:
Sten Kallin

ACM SIGAPL APL Quote Quad Volume 14, Issue 4
June 1984
362 pages
ISSN:0163-6006
DOI:10.1145/384283
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
364
Total Downloads

Downloads (Last 12 months)126
Downloads (Last 6 weeks)17

Reflects downloads up to 23 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Landaeta D(1987)The theory of function arraysProceedings of the international conference on APL10.1145/55626.55656(223-229)Online publication date: 1-Dec-1987
https://dl.acm.org/doi/10.1145/55626.55656
Landaeta D(1987)The theory of function arraysACM SIGAPL APL Quote Quad10.1145/377719.5565618:2(223-229)Online publication date: 1-Dec-1987
https://dl.acm.org/doi/10.1145/377719.55656
Brown JKallin S(1984)Function assignment and arrays of functionsProceedings of the international conference on APL10.1145/800058.801080(81-84)Online publication date: 11-Jun-1984
https://dl.acm.org/doi/10.1145/800058.801080
Brown J(1984)Function assignment and arrays of functionsACM SIGAPL APL Quote Quad10.1145/384283.80108014:4(81-84)Online publication date: 1-Jun-1984
https://dl.acm.org/doi/10.1145/384283.801080
Neitzel M(1995)Untying the Gordian knotACM SIGAPL APL Quote Quad10.1145/206944.20699225:4(145-153)Online publication date: 8-Jun-1995
https://dl.acm.org/doi/10.1145/206944.206992
Neitzel MHowland J(1995)Untying the Gordian knotProceedings of the international conference on Applied programming languages10.1145/206913.206992(145-153)Online publication date: 8-Jun-1995
https://dl.acm.org/doi/10.1145/206913.206992
Jordan SFriis E(1991)The foundations of suitability of APL2 for musicIBM Systems Journal10.1147/sj.304.051330:4(513-526)Online publication date: 1-Oct-1991
https://dl.acm.org/doi/10.1147/sj.304.0513
Benkhard J(1991)Extending structure, type, and expression in APL2ACM SIGAPL APL Quote Quad10.1145/114055.11405821:4(20-38)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114058
Benkhard JSchulz C(1991)Extending structure, type, and expression in APL2Proceedings of the international conference on APL '9110.1145/114054.114058(20-38)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114054.114058
Landaeta D(1987)The theory of function arraysProceedings of the international conference on APL10.1145/55626.55656(223-229)Online publication date: 1-Dec-1987
https://dl.acm.org/doi/10.1145/55626.55656
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Rank vs depth for array partitioning

Dynamic partitioning for array languages

L-shaped coprime array structures for DOA estimation