US4051355A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for increasing the efficiency of random access storage
Assignee: NCR Voyix Corp
•
Filing: 1976-04-29
•
Granted: 1977-09-27
•
Expires: 1996-04-29
Abstract
Abstract Apparatus and method are described wherein the average access time utilized for recovering stored data in a random access storage system is reduced. An access cycle is begun with the predetermined typical data bit delivery time known and with the knowledge of the worst case data bit delivery time. An output buffer is connected to a random access storage for receiving the data bits of an output message from the storage. The output buffer is gated to receive the data from the random access storage; the gate signal enables the output buffer to receive data bits over a predetermined time interval. The output buffer is connected to a data transmission means such as a bus, and is gated by a second signal to place the stored information on the bus. The second signal, the message gate signal, is timed to place the information stored in the output buffer on the bus during the period beginning with the typical data bit delivery time and ending after the worst case data bit delivery time. Thus, the data bits may be received from the random access storage and subsequently or immediately transmitted by the output buffer depending on the time of arrival of the data bit at the output buffer. Parity checking means check the parity of the message being transmitted from the random access storage to the output buffer; at the end of the time allowed for the worst case data bit delivery time the condition of the parity check means is ascertained, and if an incorrect parity condition exists an error/retry signal is generated to begin a retry cycle to again transmit the contents of the output buffer to the bus.
Inventors
- 👤 Juei-po Lin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 12:29
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1076; G06F11/14; G06F11/1402; G06F11/1405; G06F11/141; G11; G11C; G11C7/00; G11C7/10; G11C7/1051; G11C7/1057; G11C7/22
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
116 words
An improved method for receiving a message, having data bits therein, from a random access storage and transmitting said message, said data bits having a typical data bit delivery time and a worst case data bit delivery time, comprising the steps of: a. storing said data bits in a buffer as they are received from a random access storage; b. simultaneously transmitting said data bits from said buffer for a predetermined period of time ending after said worst case data bit delivery time; c. checking the parity of said message as the data bits therein are stored in said buffer; d. generating an error signal, when message is being transmitted to the bus and non-parity occurs.
Claim 2
Dependent Claim
116 words
An improved method for receiving a message, having data bits therein, from a random access storage and transmitting said message, said data bits having a typical data bit delivery time and a worst case data bit delivery time, comprising the steps of: a. storing said data bits in a buffer as they are received from a random access storage; b. simultaneously transmitting said data bits from said buffer for a predetermined period of time ending after said worst case data bit delivery time; c. checking the parity of said message as the data bits therein are stored in said buffer; d. generating an error signal, when message is being transmitted to the bus and non-parity occurs.
Claim 3
Dependent Claim
24 words
The method of claim 1 including the additional step of: retransmitting said data bits from said buffer after said error signal has been generated.
Claim 4
Dependent Claim
125 words
An improved method for receiving a message having data bits therein from a random access storage and transmitting said message, said data bits having a typical data bit delivery time and a worst case data bit delivery time, comprising the steps of: a. storing said data bits in a buffer as they are received from a random access storage; b. simultaneously transmitting said data bits from said buffer for a predetermined period of time beginning at said typical data bit delivery time and ending after said worst case data bit delivery time; c. checking the parity of said message as the data bits therein are stored in said buffer; d. generating an error signal, when message is being transmitted to the bus and non-parity occurs.
Claim 5
Dependent Claim
125 words
An improved method for receiving a message having data bits therein from a random access storage and transmitting said message, said data bits having a typical data bit delivery time and a worst case data bit delivery time, comprising the steps of: a. storing said data bits in a buffer as they are received from a random access storage; b. simultaneously transmitting said data bits from said buffer for a predetermined period of time beginning at said typical data bit delivery time and ending after said worst case data bit delivery time; c. checking the parity of said message as the data bits therein are stored in said buffer; d. generating an error signal, when message is being transmitted to the bus and non-parity occurs.
Claim 6
Dependent Claim
22 words
Method set forth in claim 3 including the additional step of retransmitting said data bits after said error signal has been generated.
Claim 7
Dependent Claim
223 words
In a random access storage system including a random access storage device for storing data messages comprising a plurality of data bits said system having a typical data bit delivery time and a worst case data bit delivery time, apparatus for decreasing the average access time of said system comprising: a. a data bus for transmitting data; b. an output buffer connected to said random access storage device responsive to an output buffer clock signal level for receiving and temporarily storing data bits from said device, and connected to said data bus and responsive to a data gate signal level for transmitting temporarily stored data to said bus; c. parity check means connected to said random access storage device for checking parity of messages delivered to said output buffer from said random access storage device and for generating a non-parity signal when message parity is incorrect; d. timing means connected to said output buffer for generating an output buffer clock signal level beginning before said typical data bit delivery time to enable said output buffer to receive and temporarily store said data bits and for generating a data gate signal level beginning at said typical data bit delivery time and ending after said worst case data bit delivery time to enable said output buffer to transmit temporarily stored data to said data bus.
Claim 8
Dependent Claim
223 words
In a random access storage system including a random access storage device for storing data messages comprising a plurality of data bits said system having a typical data bit delivery time and a worst case data bit delivery time, apparatus for decreasing the average access time of said system comprising: a. a data bus for transmitting data; b. an output buffer connected to said random access storage device responsive to an output buffer clock signal level for receiving and temporarily storing data bits from said device, and connected to said data bus and responsive to a data gate signal level for transmitting temporarily stored data to said bus; c. parity check means connected to said random access storage device for checking parity of messages delivered to said output buffer from said random access storage device and for generating a non-parity signal when message parity is incorrect; d. timing means connected to said output buffer for generating an output buffer clock signal level beginning before said typical data bit delivery time to enable said output buffer to receive and temporarily store said data bits and for generating a data gate signal level beginning at said typical data bit delivery time and ending after said worst case data bit delivery time to enable said output buffer to transmit temporarily stored data to said data bus.
Claim 9
Dependent Claim
24 words
The apparatus set forth in claim 5 wherein said output buffer clock signal ends at the same time as said data gate signal level.
Claim 10
Dependent Claim
27 words
The apparatus set forth in claim 5 including means responsive to the existence of said non-parity signal when message is being transmitted for generating an error/retry signal.
Claim 11
Dependent Claim
24 words
The apparatus set forth in claim 7 wherein said output buffer clock signal ends at the same time as said data gate signal level.
Claim 12
Dependent Claim
32 words
The apparatus set forth in claim 7 including means responsive to said error/retry signal for generating a second data gate signal level to retransmit the data bits stored in said output buffer.
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) | 1980-09-26 | 1981-03-28 | 1981-09-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-09-26 | 1985-03-28 | 1985-09-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-09-26 | 1989-03-28 | 1989-09-27 | $7700.00 | Window Closed / Lapsed |