Browse Prior Art Database

Delayed Preloading of Text Processing Task Programs

IP.com Disclosure Number: IPCOM000059627D
Original Publication Date: 1986-Jan-01
Included in the Prior Art Database: 2005-Mar-08
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Levine, FE: AUTHOR [+3]

Abstract

A method is described which allows the maximum usage of user machine memory and minimizes the delays due to code loading from diskette when switching tasks. On a small system, the software necessary to run an application is delivered to the customer on diskette. Because of the constraint of the size of the diskette, the code needed to perform all the tasks provided by a complex software application does not always fit on a single diskette. Also, since the application must be able to operate on systems with varying memory sizes, the code needed for all tasks may not always fit into the available memory. For this reason, code must be loaded dynamically when tasks are chosen.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 1 of 2

Delayed Preloading of Text Processing Task Programs

A method is described which allows the maximum usage of user machine memory and minimizes the delays due to code loading from diskette when switching tasks. On a small system, the software necessary to run an application is delivered to the customer on diskette. Because of the constraint of the size of the diskette, the code needed to perform all the tasks provided by a complex software application does not always fit on a single diskette. Also, since the application must be able to operate on systems with varying memory sizes, the code needed for all tasks may not always fit into the available memory. For this reason, code must be loaded dynamically when tasks are chosen. To speed the switching from one task to another within an application, it is desirable to use any additional memory above the minimal amount required by the application to pre- load some tasks that normally would require dynamic loading. When all the code for an application resides on one diskette, this pre-loading can be easily done during the initial load of the application. When all the code does not reside on one diskette this pre-loading cannot be done during the initialization since the diskette, containing many of the tasks may not have been inserted into the diskette drive by the user. Delayed pre-loading provides a mechanism for a system to pre-load some tasks, not at initial load time, but when the user first selects a task from the second diskette. The system, at that time, will load all the tasks from that second diskette that will fit into the available memory. Once pre- loading has been successfully attempted, the system will not attempt pre-loading when successive tasks are selected from the second diskette. If there was sufficient memory to pre-load some tasks, the user will gain the advantage of being able to switch from and to these tasks with minimal time lost for code loading and without the need of having the program diskette mounted. When...