Patent US3686641A successfully refreshed from Google Patents.
US3686641A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiprogram digital processing system with interprogram communication
Assignee: Unisys Corp
•
Filing: 1970-09-30
•
Granted: 1972-08-22
•
Expires: 1990-09-30
Abstract
Abstract A multiprogram computer system in which data is exchanged asynchronously between programs by transfer of data, on command of one program, to a queue in memory and, on command of another program, from the queue to the other program. The queue is double-ended so that data can be added or removed from either end of the queue to give programmatic control of priority. System integrity is maintained by providing a key word or name associated with each item in the queue. Any command to remove data from the queue searches for the item under a particular name.
Inventors
- 👤 William A Logan
- 👤 Richard M Holmes
- 👤 William M Denny
- 👤 Michael J Mahon
- 👤 Stephen Skalski
- 👤 Gerald L Henige
- 👤 Shreekant Bedekar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 03:41
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
175 words
In a multiprogram computer system in which a group of programs are stored in memory, with the commands of one program at a time being executed by a processor, the method comprising the steps of: on command of any program being executed by the processor, locating an available space in memory, loading said space in memory with a first set of data from a predetermined storage location allocated to the program being executed, storing a first linking address with the first set of data, the first linking address pointing to the base address location of another space in memory storing a second set of data, inserting a second linking address with said second set of data pointing to the base address of the newly stored first set of data, whereby each set of data loaded in memory is linked to a previously loaded set of data and to a subsequently loaded set of data, and storing the base address of the newly loaded space in a location available to all programs executed by the processor.
Claim 2
Dependent Claim
175 words
In a multiprogram computer system in which a group of programs are stored in memory, with the commands of one program at a time being executed by a processor, the method comprising the steps of: on command of any program being executed by the processor, locating an available space in memory, loading said space in memory with a first set of data from a predetermined storage location allocated to the program being executed, storing a first linking address with the first set of data, the first linking address pointing to the base address location of another space in memory storing a second set of data, inserting a second linking address with said second set of data pointing to the base address of the newly stored first set of data, whereby each set of data loaded in memory is linked to a previously loaded set of data and to a subsequently loaded set of data, and storing the base address of the newly loaded space in a location available to all programs executed by the processor.
Claim 3
Dependent Claim
79 words
The method of claim 1 further comprising the steps of: on command of a program being executed by the processor, scanning the linked data sets in sequence using the linking addresses stored with each data set; reading out a predetermined portion of each data set; comparing the portion read out with a key word; and on finding a valid comparison, transferring the entire associated set of data to a location in memory identified by the stored program being executed.
Claim 4
Dependent Claim
201 words
In a digital processing system having multiprogramming in which a plurality of programs may be stored in memory and executed on a time-shared basis by a processor, the method of transferring data from one program to another, comprising the steps of: on command of a first program, transferring a first group of data stored as part of the program in memory to a new location in memory starting at a base address of an available space in memory; storing the base address of said new location in a predetermined storage location; storing with said first group of data at the new location the base address of a second group of data stored in memory; on command from a second program, reading out a selected portion of the first data group at the base address in said predetermined storage location; comparing said selected portion with predetermined coded bits to test for equality; in the absence of equality, reading out the same selected portion of the second data group as specified by the base address stored with the first data group; and, on determining an equality condition, transferring the associated data group to a location in the memory specified by the second program.
Claim 5
Dependent Claim
201 words
In a digital processing system having multiprogramming in which a plurality of programs may be stored in memory and executed on a time-shared basis by a processor, the method of transferring data from one program to another, comprising the steps of: on command of a first program, transferring a first group of data stored as part of the program in memory to a new location in memory starting at a base address of an available space in memory; storing the base address of said new location in a predetermined storage location; storing with said first group of data at the new location the base address of a second group of data stored in memory; on command from a second program, reading out a selected portion of the first data group at the base address in said predetermined storage location; comparing said selected portion with predetermined coded bits to test for equality; in the absence of equality, reading out the same selected portion of the second data group as specified by the base address stored with the first data group; and, on determining an equality condition, transferring the associated data group to a location in the memory specified by the second program.
Claim 6
Dependent Claim
31 words
The method of claim 3 further including the steps of: on determining an equality condition, transferring the data group to a location in the main memory specified by the second program.
Claim 7
Dependent Claim
36 words
The method of claim 3 further including the step of: changing the base address pointing to the group of data transferred to the second program to the base address stored with said group of transferred data.
Claim 8
Dependent Claim
148 words
Apparatus for storing items in memory comprising: an aDdressable memory having a plurality of items stored in various locations in memory, each item having two link addresses to two other items and each link address of an item pointing to another item having a link address pointing back to the same item; means storing first and second addresses pointing respectively to two of the items; means storing the address of a memory location for a new item; and means for linking the new item location to either of the two items indicated by said means storing first and second addresses, said means linking the new item location including means for storing a selected one of said first and second addresses as a link address in the new item in memory and means replacing said selected address in said storing means with the address of the new item location.
Claim 9
Dependent Claim
148 words
Apparatus for storing items in memory comprising: an aDdressable memory having a plurality of items stored in various locations in memory, each item having two link addresses to two other items and each link address of an item pointing to another item having a link address pointing back to the same item; means storing first and second addresses pointing respectively to two of the items; means storing the address of a memory location for a new item; and means for linking the new item location to either of the two items indicated by said means storing first and second addresses, said means linking the new item location including means for storing a selected one of said first and second addresses as a link address in the new item in memory and means replacing said selected address in said storing means with the address of the new item location.
Claim 10
Dependent Claim
139 words
Apparatus of claim 6 further including means responsive to said means storing first and second addresses for reading out a portion of an item including the link addresses selectively from one of said first and second address locations in memory, means comparing the portion read out with a predetermined condition identifying a particular item, means responsive to the comparing means when the portion read out is not equal to said predetermined condition for reading out a portion of an item from one of the link address locations associated with the prior item read out, and means responsive to the comparing means when the portion read out is equal to said predetermined condition for transferring each of the two addresses associated with the item portion read out to the respective items identified by the other of the two link addresses.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-08-22 | 1976-02-21 | 1976-08-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-08-22 | 1980-02-21 | 1980-08-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-08-22 | 1984-02-21 | 1984-08-22 | $7700.00 | Window Closed / Lapsed |