Cited By
View all- Trivedi K(1977)On the Paging Performance of Array AlgorithmsIEEE Transactions on Computers10.1109/TC.1977.167472926:10(938-947)Online publication date: 1-Oct-1977
Dynamic partitioning for array languages
Pages 1023 - 1032
Abstract
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 arbitrary manner. These definitions are motivated with several realistic examples to illustrate the value of partitioning for array languages.
Of general interest is the data structure for partitioning. This consists of dynamic tree structures which are used to derive and maintain the array control information. These are described in sufficient detail to be of value in the design of other array languages. The description presented in this paper is implemented in a new array language, OL/2, currently under development at the University of Illinois.
References
[1]
Adams, H.C. Dynamic partitioning in the array language OL/2. DCL Report No. 421, Dept. of Comput. Sci., U. of Illinois at Urbana-Champaign, Urbana, Ill., Jan. 1971.
[2]
Bayer, R., and Witzgall, C. Some complete calculi for matrices. Comm. ACM 13, 4 (Apr. 1970), 223-237.
[3]
Cohen, S., and Vincent, C.M. An introduction to SPEAK- EASY. Report PHY-1968E, Argonne Nat. Lab., Argonne, Ill., Dec. 1968.
[4]
Dantzig, G.B., et al. MPL mathematical programming language specification manual for committee review. STAN-CS- 70-187, Comput. Sci. Dept., Stanford U., Stanford, Calif., Nov. 1970.
[5]
Iverson, K.E. A Programming Language. Wiley, New York, 1962.
[6]
Phillips, J.R. The structure and design philosophy of OL/2-- an array language. Part II: Algorithms for dynamic partitioning. DCL Report No. UIUCDCS-R-71-420, Dept. of Comput. Sci., U. of Illinois at Urbana-Champaign, Urbana, I11. 1971.
Recommendations
Efficient Partitioning Method for Optimizing the Compression on Array Data
AbstractArray partitioning is an important research problem in array management area, since the partitioning strategies have important influence on storage, query evaluation, and other components in array management systems. Meanwhile, compression is ...
Efficient Representation Scheme for Multidimensional Array Operations
Array operations are used in a large number of important scientific codes, such as molecular dynamics, finite element methods, climate modeling, etc. To implement these array operations efficiently, many methods have been proposed in the literature. ...
Computing transitive closure on systolic arrays of fixed size
Forming the transitive closure of a binary relation (or directed graph) is an important part of many algorithms. When the relation is represented by a bit matrix, the transitive closure can be efficiently computed in parallel in a systolic array.Here we ...
Comments
Information & Contributors
Information
Published In
Dec. 1972
117 pages
Copyright © 1972 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1972
Published in CACM Volume 15, Issue 12
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 328Total Downloads
- Downloads (Last 12 months)31
- Downloads (Last 6 weeks)3
Reflects downloads up to 10 Aug 2024
Other Metrics
Citations
Cited By
View all- Trivedi K(1977)On the Paging Performance of Array AlgorithmsIEEE Transactions on Computers10.1109/TC.1977.167472926:10(938-947)Online publication date: 1-Oct-1977
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in