Patent US4481576A successfully refreshed from Google Patents.
US4481576A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of storing data in a memory of a data processing system
Assignee: US Philips Corp
•
Filing: 1982-03-19
•
Granted: 1984-11-06
•
Expires: 2002-03-19
Abstract
Abstract When addressing a store comprising a plurality of low speed memory blocks each of which can be accessed through a high speed buffer having a limited number of memory elements, in accordance with a pattern which is more flexible than sequential then conflicts can occur due to overloading of the memory elements. In order to avoid this, prior to storing data, the address parameters are calculated taking into account the read/write sequence, depth of buffer and access times and a check is made to see if there are any conflicts among the simulated addresses. If so then a number of alternative measures can be tried in order to resolve the conflicts. Such measures include the use of a small capacity, high speed vestigial memory, adding an offset to the addresses or skipping a number of addresses. Once acceptable address parameters have been calculated then a hardware address generator can be instructed to address data accordingly.
Inventors
- 👤 John Bicknell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:37
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/06; G06F5/065
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
187 words
A method of storing data in a memory of a data processing system, which memory comprises a plurality of memory blocks, characterized in that said method comprises the steps of: (a) checking if storing according to a standard address pattern is applicable for a required storage operation without infringing an access restricting of the addressed memory block, and in the case where said standard address pattern is applicable, activating an address generator for generating addresses according to said standard address pattern; (b) in the case where said standard address pattern is not applicable, remapping, according to a first predetermined distribution pattern, the addresses of those locations in the memory to which access is required; (c) checking if storing according to said first predetermined distribution pattern is applicable for the required storage operation without infringing an access restriction of the addressed memory block, and in the case where said first predetermined distribution pattern is applicable, activating said address generator for generating addresses according to said first predetermined distribution pattern; and (d) in the case where said first predetermined distribution pattern is not applicable, generating a first conflict signal.
Claim 2
Independent Claim
187 words
A method of storing data in a memory of a data processing system, which memory comprises a plurality of memory blocks, characterized in that said method comprises the steps of: (a) checking if storing according to a standard address pattern is applicable for a required storage operation without infringing an access restricting of the addressed memory block, and in the case where said standard address pattern is applicable, activating an address generator for generating addresses according to said standard address pattern; (b) in the case where said standard address pattern is not applicable, remapping, according to a first predetermined distribution pattern, the addresses of those locations in the memory to which access is required; (c) checking if storing according to said first predetermined distribution pattern is applicable for the required storage operation without infringing an access restriction of the addressed memory block, and in the case where said first predetermined distribution pattern is applicable, activating said address generator for generating addresses according to said first predetermined distribution pattern; and (d) in the case where said first predetermined distribution pattern is not applicable, generating a first conflict signal.
Claim 3
Dependent Claim
117 words
A method as claimed in claim 1, characterized in that, after generating said first conflict signal, the method comprises the steps of: (a) remapping, according to a second predetermined address pattern, the addresses of those locations in the memory to which access is required; (b) checking if storing according to said second predetermined address pattern is applicable for the required storage operation without infringing an access restriction of the addressed memory block, and in the case where said second predetermined address pattern is applicable, activating said address generator for generating addresses according to said second predetermined address pattern; and (c) in the case where said second predetermined address pattern is not applicable, generating a second conflict signal.
Claim 4
Dependent Claim
28 words
A method as claimed in claim 1, characterized in that said remapping according to a first predetermined distribution pattern comprises decreasing the frequency of access to the memory.
Claim 5
Dependent Claim
30 words
A method as claimed in claim 2, characterized in that said remapping according to said second predetermined address pattern comprises the redistribution over an offset added to the store addresses.
Claim 6
Dependent Claim
47 words
A method as claimed in claim 2, characterized in that said remapping according to said second predetermined address pattern comprises the remapping of the address infringing the access restriction to a location of a vestigial memory and the storage in said vestigial memory of the associated data.
Claim 7
Independent Claim
57 words
A method as claimed in any one of the claims 1 to 5, for application to a display device with line-wise scanning, characterized in that said remapping comprises the remapping of the address infringing the access restriction to a buffer, said buffer being filled during a line scan and emptied during the flyback period of said scanning.
Claim 8
Dependent Claim
107 words
A data processing system for applying the method according to claim 6, comprising a main memory, a vestigial memory, an address generator for generating storage addresses for data to be stored in the main or vestigial memory, characterized in that said data processing system comprises means for mapping the address of a storage location for data according to a given pattern, means for checking if there are addresses infringing an access restriction of said main memory, and means for resolving said infringements by remapping the infringing addresses, said means for resolving having an output for instruction the address generator to generate addresses in accordance with said remapping.
Claim 9
Dependent Claim
22 words
A data processing system as claimed in claim 7, characterized in that said main memory is provided with an additional write-in buffer.
References Cited (Backward Citations)
US4383296A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-11-06 | 1988-05-07 | 1988-11-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-11-06 | 1992-05-07 | 1992-11-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-11-06 | 1996-05-07 | 1996-11-06 | $7700.00 | Window Closed / Lapsed |