| |
 |
Method and means for defective bit processing in a fault tolerant bubble storage system |
| T100402 |
Method and means for defective bit processing in a fault tolerant bubble storage system
|
|
| Patent Drawings: | |
| Inventor: |
Gindi, et al. |
| Date Issued: |
March 3, 1981 |
| Application: |
06/166,718 |
| Filed: |
July 7, 1980 |
| Inventors: |
Gindi; Abraham M. (San Jose, CA)
Orfali; Magdi R. (San Jose, CA)
Patel; Arvind M. (San Jose, CA)
|
| Assignee: |
International Business Machines Corporation (Armonk, NY) |
| Primary Examiner: |
|
| Assistant Examiner: |
|
| Attorney Or Agent: |
|
| U.S. Class: |
365/15 |
| Field Of Search: |
|
| International Class: |
|
| U.S Patent Documents: |
|
| Foreign Patent Documents: |
|
| Other References: |
|
|
| Abstract: |
A method and means for modifying up to k bits in each byte of (n+k) bits to be accessed with respect to counterpart minor loops of a sequentially accessed byte-organized major/minor loop memory array. The combination of bad byte location pointers and a byte mask is used to delete bits on bad bytes extracted from the memory or to insert zeroes into defective loop locations when bad bytes are written into the memory. Alternatively, the ith bit in each byte of (n+1) bits to be accessed may be modified through the utilization of the value of the ith bit written into the byte position of n+1st bit, while the ith bit of a defective byte position is zeroed. As a bad byte is extracted, the value of the n+1st bit is substituted for the ith bit. A dense list, rather than a sparse bad byte pointer list, is used. |
| Claim: |
|
| Description: |
|
|
|
|
