Patent US4477880A successfully refreshed from Google Patents.
US4477880A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for combining program diskettes in an interactive text processing system
Assignee: International Business Machines Corp
•
Filing: 1981-10-13
•
Granted: 1984-10-16
•
Expires: 2001-10-13
Abstract
Abstract A method is disclosed for improving the efficiency of an operator of an interactive text processing system in which a plurality of different text processing task programs are each stored on a different single-sided, single-density (1S1D) diskette so that in the creation and use of a text document involving several different tasks, the operator's efficiency is decreased due to the time involved in inserting and removing each required diskette. The method involves creating a combined program diskette on a two-sided, double-density (2S2D) diskette by sequentially transferring program modules for interactively selected text processing task programs from corresponding 1S1D diskettes under the control of a "Combine" program. The method provides one 2S2D combined text processing program diskette containing all the programs necessary to create and use a specific text document by means of the selected tasks.
Inventors
- 👤 Hira Advani
- 👤 William C. Cason
- 👤 Gerald E. Hayes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 21:03
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F40/00; G06F40/10; G06F8/00; G06F8/60; G06F8/61
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
301 words
In an operator controlled interactive text processing system having a keyboard, display device, and a diskette drive for interactively entering programs into said system from a plurality of program source diskettes that are inserted individually into said diskette drive, said system performing test processing tasks that are selected by said operator interactively from menus which are displayed by said system to said operator from portions of said entered programs where said operator is required to insert said plurality of program source diskettes individually into said diskette drive whenever the desired text processing task to be performed by said operator requires a set of text processing task programs stored on different said program source diskettes, the method of combining a selected said set of said text processing task programs initially stored on said plurality of different program source diskettes onto one destination diskette to avoid said operator inserting and removing said plurality of program source diskettes into and from said diskette drive each time said operator controls said system to execute said set of selected text processing task programs, said method comprising the steps of entering into said system a "combine" program and executing said combine program to cause said system to combine on said one destination diskette text processing task programs from each of said separate program source diskettes that are selected in accordance with selection data that is entered into said system interactively by said operator in response to displayed menus which are entered into said system as part of said "combine" program and which display identifiable options corresponding to said text processing programs to be transferred to said destination diskette, entering said selected data into said system when said menus are displayed, and transferring to said destination diskette each said program identified to said system by said selection data.
Claim 2
Dependent Claim
301 words
In an operator controlled interactive text processing system having a keyboard, display device, and a diskette drive for interactively entering programs into said system from a plurality of program source diskettes that are inserted individually into said diskette drive, said system performing test processing tasks that are selected by said operator interactively from menus which are displayed by said system to said operator from portions of said entered programs where said operator is required to insert said plurality of program source diskettes individually into said diskette drive whenever the desired text processing task to be performed by said operator requires a set of text processing task programs stored on different said program source diskettes, the method of combining a selected said set of said text processing task programs initially stored on said plurality of different program source diskettes onto one destination diskette to avoid said operator inserting and removing said plurality of program source diskettes into and from said diskette drive each time said operator controls said system to execute said set of selected text processing task programs, said method comprising the steps of entering into said system a "combine" program and executing said combine program to cause said system to combine on said one destination diskette text processing task programs from each of said separate program source diskettes that are selected in accordance with selection data that is entered into said system interactively by said operator in response to displayed menus which are entered into said system as part of said "combine" program and which display identifiable options corresponding to said text processing programs to be transferred to said destination diskette, entering said selected data into said system when said menus are displayed, and transferring to said destination diskette each said program identified to said system by said selection data.
Claim 3
Dependent Claim
52 words
The method recited in claim 1, further including the step of transferring other non-program type information from at least one of said program source diskettes to said one destination diskette in accordance with other selection data that is entered into said system interactively by said operator in response to said displayed menus.
Claim 4
Dependent Claim
64 words
The method recited in claim 2 in which said program source diskettes store said text processing task programs only on one side Sl at a bit density Dl and said transfer step transfers said text processing task programs and said non-program type information to both sides S2 of said destination diskette at a bit density D2 which is approximately twice the bit density Dl.
Claim 5
Dependent Claim
50 words
The method recited in claim 3 in which said text processing task programs that are combined on said destination diskette include an IPL program, a basic text processing task program, a first plurality of feature programs, and a second plurality of spell-check programs for checking the correct spelling of words.
Claim 6
Dependent Claim
38 words
The method recited in claim 4 in which said step of transferring said non-program information includes transferring operator entered data that has been recorded on said at least one program source diskette as "setup" data and supplementary dictionaries.
Claim 7
Dependent Claim
39 words
The method recited in claim 5 in which said basic text processing task program and said "combine" program are transferred to said destination diskette as a logical copy prior to transferring any other said program to said destination diskette.
Claim 8
Dependent Claim
83 words
The method recited in claim 6 in which said step of transferring the basic text processing program as a logical copy includes transferring a plurality of programming modules, each of which has been assigned to only one of a plurality of data sets, and transferring a corresponding plurality of data set directories, each of which define the location on said destination diskette of the start of each transferred said module associated with said data set along with the length of said transferred module.
Claim 9
Dependent Claim
30 words
The method recited in claim 7 in which each said transferred data set directory is recorded on said destination diskette immediately preceding said programming modules assigned to said data set.
Claim 10
Dependent Claim
39 words
The method recited in claim 8 in which said step of transferring data set directories only transfers a said directory from said program source diskette if there is at least one programming module assigned to said corresponding data set.
Claim 11
Dependent Claim
120 words
The method recited in claim 9 further including the step of transferring feature programming modules from a feature program source diskette containing a selected feature program to said destination diskette, said feature programming module transfer step including first, transferring the said feature programming modules from said feature program source diskette to said destination diskette beginning with program modules which are assigned to the lowest order data sets while updating the corresponding said data set directories stored in said system and allocating space on said destination diskette for a new data set directory immediately following any feature programming modules previously transferred to said destination diskette, and recording all said transferred feature programming modules for that data set following said allocated space.
Claim 12
Dependent Claim
85 words
The method recited in claim 10 further including the step of transferring selected language modules and dictionaries from one of said program source diskettes to said destination diskette, said language module transfer step including first, transferring in data set order said language programming modules assigned to data sets having data set directories previously transferred to said destination diskette, allocating other data set directory space on said destination diskette, and transferring any remaining language programming modules to said destination diskette immediately following said other directory space.
Claim 13
Dependent Claim
31 words
The method recited in claim 1 further including the step of displaying to said operator predefined messages advising said operator when to remove and insert each said separate program source diskette.
Claim 14
Dependent Claim
29 words
The method recited in claim 11 further including the step of transferring any data set directory stores in said system to said previously allocated space on said destination diskette.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-10-16 | 1988-04-16 | 1988-10-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-10-16 | 1992-04-16 | 1992-10-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-10-16 | 1996-04-16 | 1996-10-16 | $7700.00 | Window Closed / Lapsed |