公开(公告)号：US20070150791A1

公开(公告)日：2007-06-28

申请号：US11319888

申请日：2005-12-27

申请人： Stephen Gross ,  Bryan Mee

发明人： Stephen Gross ,  Bryan Mee

IPC分类号： G11C29/00

CPC分类号： G06F11/1044

摘要： A portion of data stored in a non-volatile memory may be found to be corrupted when it is read. Where parity data is generated from portions of data and the parity data is stored with the portions of data, the corrupted data may be reconstructed from the parity data and uncorrupted portions of data.

摘要翻译： 存储在非易失性存储器中的数据的一部分在读取时可能被破坏。 在从数据部分生成奇偶校验数据的同时，与数据部分一起存储奇偶校验数据，可以从奇偶校验数据和数据的未被破坏的部分重建损坏的数据。

公开(公告)号：US20070150790A1

公开(公告)日：2007-06-28

申请号：US11319254

申请日：2005-12-27

申请人： Stephen Gross ,  Bryan Mee

发明人： Stephen Gross ,  Bryan Mee

IPC分类号： G11C29/00

CPC分类号： G06F11/1044

摘要： A portion of data stored in a non-volatile memory may be found to be corrupted when it is read. Where parity data is generated from portions of data and the parity data is stored with the portions of data, the corrupted data may be reconstructed from the parity data and uncorrupted portions of data.

摘要翻译： 存储在非易失性存储器中的数据的一部分在读取时可能被破坏。 在从数据部分生成奇偶校验数据的同时，与数据部分一起存储奇偶校验数据，可以从奇偶校验数据和数据的未被破坏的部分重建损坏的数据。

公开(公告)号：US5963977A

公开(公告)日：1999-10-05

申请号：US947213

申请日：1997-10-09

申请人： Clifford M. Gold ,  Hang D. Nguyen ,  George Li ,  Minnie Uppuluri ,  Hoa Luong ,  Steve Paul ,  Bryan Mee ,  Trinh Bui

发明人： Clifford M. Gold ,  Hang D. Nguyen ,  George Li ,  Minnie Uppuluri ,  Hoa Luong ,  Steve Paul ,  Bryan Mee ,  Trinh Bui

IPC分类号： G06F3/06 ,  G06F12/00

CPC分类号： G06F3/061 ,  G06F3/0656 ,  G06F3/0674

摘要： A method of coordinating access to a data buffer including a plurality of data blocks, using a buffer list with a plurality of entries corresponding to the data blocks. Each buffer list entry includes: (i) a status code for indicating the status of data in the corresponding data block, and (ii) a partial address common to both the next buffer list entry and a data block corresponding to said next buffer list entry. A status code is selected from a cyclical set of sequential status codes having a period of N, the status codes sequentially, and alternately, representing the most recent history of a data block, including: (i) full status, indicating data in the data block has been retrieved from the storage device or is to be stored to the storage device, or (ii) empty status, indicating data transferred out of the data block to a host or to the storage device. A store flag maintains a status code representing empty status, and a retrieve flag maintains a status code representing full status. When storing data into the data buffer, locating a desired buffer list entry list with an empty status code by traversing the buffer list, calculating the address of each entry using the partial address in the previous entry, until the desired entry is found. The address of the data block corresponding to the found entry is calculated and data is stored in the data block when the status code of the entry matches the store flag status code. The found entry status code is advanced once, and if the entry is last in the buffer list the store flag status code is advanced twice. Similarly, when retrieving data from the data buffer, locating a desired entry in the buffer list with a full status code by traversing the buffer list, calculating the address of each entry using the partial address in the previous entry, until the desired entry is found. The address of the data block corresponding to the found entry is calculated and data is retrieved from the data block when the status code of the entry matches the retrieve flag status code. The found entry status code is advanced once, and if the entry is last in the buffer list the retrieve flag status code is advanced twice.