Thumbnail
Access Restriction
Subscribed

Author Adams, H. C. ♦ Phillips, J. Richard
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Array partitioning ♦ Programming language design ♦ Tree structure ♦ Dynamic partitioning ♦ Array control blocks ♦ Array language ♦ Data structure ♦ Partition control blocks
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.
Description Affiliation: Eglin Air Force Base, FL (Adams, H. C.) || Univ. of Illinois at Urbana-Champaign, Urbana (Phillips, J. Richard)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 12
Page Count 10
Starting Page 1023
Ending Page 1032


Open content in new tab

   Open content in new tab
Source: ACM Digital Library