THE DYNAMIC CHARACTERISTICS OF COMPUTER PROGRAMS

The report gives statistics which indicate that substantial gains are achievable through a multiplexed program mode of operation. Substantial numbers of programs exist in the small-time and small-program size categories to insure that programs can be easily found which will fit available time-space slots. Further, because of these factors, rather simple allocation algorithms will be sufficient. Also shown is that there are substantial gains to be achieved in storage allocation areas--both in list processing styles of storage allocation in which both the location and its contents are important data in the storage reference, and in the dynamic storage requests in which tables of nominal size are expended to fill the needs of the program as it executes. It would not be overstating the case to predict that an efficiency or through-put gain of 100 percent is achievable through implementation of these techniques.