Abstract
When using multi-dimensional arrays in high level languages a mapping has to be performed between the array indices and the address space of the machine. Except for some special purpose processors this address space is one-dimensional, so the mapping is from a multi-dimensional space to a one-dimensional space. There are many possible mappings that can be used, and all high level languages use one particular mapping that is easy to implement — the row/column mapping where either rows or columns are stored in consecutive memory locations.
The National Radio Astronomy Observatory is operated Associated Universities Inc. under contract with the National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Plenus Press, New York
About this chapter
Cite this chapter
Moore, P. (1986). An Indexing Algorithm for Large Melti-Dimensional Arrays. In: Di Gesù, V., Scarsi, L., Crane, P., Friedman, J.H., Levialdi, S. (eds) Data Analysis in Astronomy II. Ettore Majorana International Science Series, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2249-8_18
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2249-8_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9317-0
Online ISBN: 978-1-4613-2249-8
eBook Packages: Springer Book Archive