Carleton University
Technical Report TR-58
August 1984
Computer Access Methods for Extendible Arrays of Varying Dimensions
E. Otoo
Abstract
We introduce a method of managing storage for dense rectangular arrays in consecutive memory locations such that the number of dimensions as well as the index range of each dimension can be extendible. The method realizes an n-element array of any shape in 8(n.) storage locations with a computed access function of complexity O(d2), where1 n and d are respectively, the size and dimensionality of the array at any instant. This presents a solution to a. more difficult variant of an open question of Rosenberg that asks whether or not a. realization exists which favours non-trivial infinite family of shapes such that an array of n elements is spread over at most C • n locations for some integer C. We show that C 3.25 for any d and n > > cl.