Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Fault Tolerant Array

IP.com Disclosure Number: IPCOM000107482D
Original Publication Date: 1992-Feb-01
Included in the Prior Art Database: 2005-Mar-21
Document File: 1 page(s) / 33K

Publishing Venue

IBM

Related People

McGilvray, BL: AUTHOR [+2]

Abstract

In an array designed for retrieving data, groups of data are sequentially loaded in the array. If a solid failure occurs in the array, the array contents become broken because all locations need to be searched. The search algorithm of data in the array searches each location.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Fault Tolerant Array

      In an array designed for retrieving data, groups of data are
sequentially loaded in the array.  If a solid failure occurs in the
array, the array contents become broken because all locations need to
be searched.  The search algorithm of data in the array searches each
location.

      Upon detection of the solid error, this design places a
transfer identifier in a reserved location of the data field, in the
address immediately before the broken location, so upon reload, when
a search is made, the transfer identifier skips the broken location
and goes to the next good location.  The transfer address allows
transfer around the broken location.  An incrementer register can be
added to have the logic skip multiple contiguous addresses according
to the value in the incrementer.

      In addition, a Starting Address Pointer is maintained to bypass
addresses at the beginning of the array.  If the first address
(Address 0) is bad, the search begins Address 1 or whatever the
pointer is set at.

      Disclosed anonymously.