Browse Prior Art Database

Compile Algorithm to Optimize Array Storage

IP.com Disclosure Number: IPCOM000047113D
Original Publication Date: 1983-Sep-01
Included in the Prior Art Database: 2005-Feb-07

Publishing Venue

IBM

Related People

Authors:
Watson, DH [+details]

Abstract

This article describes an improved method for allocating arrays during compilation of a computer program. The compiler first sorts the arrays in order of increasing size, and then allocates storage to the arrays in the order given by the sorted result. As a result, many arrays may now be covered by a single base register, thus reducing the number of instructions needed for the load of base registers in the code generated by the compiler, and reducing paging when operating on these arrays.