← Back to Patent Explorer
EP0031499A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Data processing apparatus adapted for memory readback checking

Assignee: International Business Machines Corp
•
Filing: 1980-12-04
•
Granted: —
•
Expires: 2000-12-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract To provide for a more economic buffer capacity through facilitating high speed readback check of data transferred to a cyclic memory (16) from a free input buffer before the source data is lost, the cyclic memory is organized into a number of data blocks, each interleaved with or simultaneously accessible with the other data blocks. Thus, a long data record comprises several data blocks and therefore several cycles of the memory. A readback check of data transferred is accomplished by writing data into one check number generator (51) and one data block in a first cycle, writing data into another block on the second cycle while reading back the first data block to a second check number generator (52), continuing in this manner until the entire record is transferred, and reading the last block of written data into the check number generator (52). The two generated check numbers are then compared to detect any error and effect a retransfer if required before the source of the record is lost by overwriting.

Inventors

  • 👤 James Arthur Brewer
  • 👤 John Alfred Lowy

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-31 23:47
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1076; G06F11/14; G06F3/00; G06F3/06; G06F3/0601; G06F3/0628; G06F3/0655; G06F3/0656

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 235 words
Data processing apparatus of the kind including a data input (12) feeding a buffer store (14) feeding a cyclic working store (16) serving utilization apparatus (17), the input data being assembled into records in the buffer store and transferred as records in a plurality of consecutive cycles to the cyclic working store, such transfer being checked, characterized in that (a) the checking mechanism (18) includes two related progressive check number generators (51; 52), one (51) connected to the output (24, 26, 27) of the buffer store and one (52) connected to the output (77; 30; 54) of the cyclic working store and means (53) to test, at selected times, the equivalence under the relationship of the generated check numbers; (b) the buffer and cyclic working stores having effectively the same cycle time are served by a common control (15) effective during transfer of a record to non-destructively output from the buffer a unit of transfer in each cycle save the last, to write each such unit of transfer into both the cyclic working store and out of the check number generators and to non-destructively output from the cyclic working store a previously stored unit of transfer in each cycle save the first into the other check number generator, the control actuating the test means after the last cycle, and (c) the control means being responsive to a non-equivalent test result, to retransfer the failed record.
Claim 2
Dependent Claim 235 words
Data processing apparatus of the kind including a data input (12) feeding a buffer store (14) feeding a cyclic working store (16) serving utilization apparatus (17), the input data being assembled into records in the buffer store and transferred as records in a plurality of consecutive cycles to the cyclic working store, such transfer being checked, characterized in that (a) the checking mechanism (18) includes two related progressive check number generators (51; 52), one (51) connected to the output (24, 26, 27) of the buffer store and one (52) connected to the output (77; 30; 54) of the cyclic working store and means (53) to test, at selected times, the equivalence under the relationship of the generated check numbers; (b) the buffer and cyclic working stores having effectively the same cycle time are served by a common control (15) effective during transfer of a record to non-destructively output from the buffer a unit of transfer in each cycle save the last, to write each such unit of transfer into both the cyclic working store and out of the check number generators and to non-destructively output from the cyclic working store a previously stored unit of transfer in each cycle save the first into the other check number generator, the control actuating the test means after the last cycle, and (c) the control means being responsive to a non-equivalent test result, to retransfer the failed record.
Claim 3
Dependent Claim 60 words
Apparatus as claimed characterized in that the cyclic working store has a writing station and a reading station and a plurality of data slots each presented sequentially to the writing station and to the reading station once per cycle, the control means being arranged to cause the writing of the units of transfer of a record in an interleaved manner.
Claim 4
Dependent Claim 50 words
Apparatus as claimed in claim 2 characterized in that the buffer store has a parallel by bit, serial by unit of transfer output to a pair of "ping-pong" buffers connected to the writing stations and to the said one of the check number generators via a parallel to serial converter.
Claim 5
Dependent Claim 34 words
Apparatus as claimed in any preceding claim characterized in that the control means is arranged to reset the check number generators to identical states between successive record transfers, the test means testing for equality.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag