Coding techniques for failure recovery in a distributive modular memory organization

Authors:
S. A. Szygenda;M. J. Flynn
Affiliations:
Southern Methodist University, Dallas, Texas;The Johns Hopkins University, Baltimore, Maryland
Venue:
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Year:
1971

Citing 1
Cited 2

A model and implementation of a universal time delay simulator for large digital nets

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference

Acceptable Testing of VLSI Components Which Contain Error Correctors

IEEE Transactions on Computers
Installation management: the next ten years

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers various coding techniques which could be applied to a memory organization to achieve detection and correction of failures. In this discussion, we define a fault as a malfunction of a systems component and a failure as a manifestation of a fault. Notice that a single fault can result in multiple failures. Thus, techniques such as error-detecting and correction codes, when used alone, are limited in that they operate on failures---not faults.