Citation
Abstract
This article will discuss the relationship between the efficiency of software operation and the use within that software of conventional control structures such as loops and subroutines. These control structures ‘fold’ a program to reduce its storage requirements at the expense of increased execution time. The typical intuitive response to this consideration is one of “the faster, the better.” In some contexts, this is far from correct. The extent to which folding should be done depends upon many factors, including especially the program’s total size. The extent to which this folding can actually be done depends upon details of its operation, so the analysis presented in this article will of necessity retreat from reality, and assume that the program in question can be folded arbitrarily. Straight Line Machine Algorithm (SLMA) of S steps on
Details
- Volume
- XIV
- Published
- April 15, 1973
- Pages
- 124–130
- File Size
- 756.6 KB