Overview

Excerpt from Automatic Storage Optimization Most studies of optimization techniques for higher level languages have focused on improving execution time of generated programs, often at the expense of increased storage. When storage optimization has been addressed, it is usually in conjunction with time Optimization, such as in instruction-reducing code transformations. In Section two existing storage - Optimizing compilers are discussed. The rising popularity of minicomputers and microprocessors suggests that the time has come to take a closer look at the problem of automatic storage optimization. Because lack of space has always been a problem in the small machine environ ment, the proliferation of small machines implies the increasing importance of the problem. Although the decreasing cost of memory may mitigate this trend, a variant of Murphy's law ensures that program size will always increase faster than the available storage; in short, programmers will always write programs that don't fit. Even without the advent of the small computer, such an investigation would be warranted from a language point of view. Today, almost all programming languages include the notionof storage in the concept of a variable, and most compilers maintain a one - to - one mapping between variables and storage This means that, in a tight storage situation, the programmer must overlap storage by deliberately using a single variable for more than one purpose, to the detriment of the clarity and reliability of the program. A desirable goal would be a language in which variables had no storage connotation, but where the processor performed all storage allocation deci sions, guaranteeing only the integrity of the variable. This is an important goal, since, unlike the case of time optimization, where the scope of a coding trick is relatively local, a storage-optimizing coding trick often obscures the entire program. Storage optimization is also applicable in Virtual storage systems where a decrease in program size may result in a smaller page requirement for the object program, with consequent improvement in program execution time. The related question of organizing procedures of a given size so as to minimize interpage transitions has been treated by Kernighan (ker70, Ker71) About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Full Product Details

9781334016592

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available