公开(公告)号：DE69504918T2

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

申请号：DE69504918

申请日：1995-06-16

Applicant: IBM

Inventor： CHEN JAMES C ,  GLIDER JOSEPH S ,  SHIPMAN LLOYD R ,  STAMNESS JESSE I

IPC: G06F3/06 ,  G06F11/10 ,  G06F12/08 ,  G06F12/16

Abstract: The present system may be utilized to minimize access performance penalties in memory subsystems which utilize redundant arrays of disk memory devices. Redundant arrays of disk memory devices provide levels of reliability which are not available with single storage devices; however, the redundancy carries with it an access performance degradation due to the requirement that such systems write data segments and parity elements to the array each time an application updates data within the system. A large nonvolatile cache is therefore provided in association with a redundant array of disk memory devices. Each time a data segment is written or read the data segment is staged from the array to the nonvolatile cache, if the data segment is not already within the cache. Additionally, if the operation is an update, a parity element associated with the data segment to be updated is also staged to the cache with the existing data segment content. An updated parity element is then calculated based upon the updated data, the existing data and the existing parity element. Data segments and associated parity elements are then maintained in the cache for future reading and updates until the number of updated data segments within the cache exceeds a predetermined value. Thereafter, selected data segments and associated parity elements are destaged from the cache to the array based upon a "Least Recently Utilized" (LRU) or "minimum seek" algorithm.

公开(公告)号：DE102013206744A1

公开(公告)日：2013-10-31

申请号：DE102013206744

申请日：2013-04-16

Applicant: IBM

Inventor： CHAMBLISS DAVID D ,  CONSTANTINESCU MIHAIL C ,  GLIDER JOSEPH S ,  LU MAOHUA

IPC: G06F12/08 ,  G06F17/30

Abstract: Das Erkennen einer Datenduplizierung weist das Verwalten eines Fingerabdruckverzeichnisses auf, das einen oder mehrere Einträge enthält, wobei jeder Eintrag einen Datenfingerabdruck und einen Datenspeicherort für einen Datenblock enthält. Jedem Eintrag wird ein Gesehen-Gezählt-Attribut zugeordnet, das eine Angabe dafür ist, wie oft der Fingerabdruck in ankommenden Datenblöcken gesehen worden ist. Einträge mit höherer Häufigkeit in dem Verzeichnis werden beibehalten, wobei auch die Aktualität von Datenzugriffen berücksichtigt wird. Ein Duplikat-Detektor erkennt, dass der Datenfingerabdruck für einen neuen Block derselbe ist wie der Datenfingerabdruck, der in einem Eintrag in dem Fingerabdruckverzeichnis enthalten ist.

公开(公告)号：DE69504918D1

公开(公告)日：1998-10-29

申请号：DE69504918

申请日：1995-06-16

Applicant: IBM

Inventor： CHEN JAMES C ,  GLIDER JOSEPH S ,  SHIPMAN LLOYD R ,  STAMNESS JESSE I

IPC: G06F3/06 ,  G06F11/10 ,  G06F12/08 ,  G06F12/16

Abstract: The present system may be utilized to minimize access performance penalties in memory subsystems which utilize redundant arrays of disk memory devices. Redundant arrays of disk memory devices provide levels of reliability which are not available with single storage devices; however, the redundancy carries with it an access performance degradation due to the requirement that such systems write data segments and parity elements to the array each time an application updates data within the system. A large nonvolatile cache is therefore provided in association with a redundant array of disk memory devices. Each time a data segment is written or read the data segment is staged from the array to the nonvolatile cache, if the data segment is not already within the cache. Additionally, if the operation is an update, a parity element associated with the data segment to be updated is also staged to the cache with the existing data segment content. An updated parity element is then calculated based upon the updated data, the existing data and the existing parity element. Data segments and associated parity elements are then maintained in the cache for future reading and updates until the number of updated data segments within the cache exceeds a predetermined value. Thereafter, selected data segments and associated parity elements are destaged from the cache to the array based upon a "Least Recently Utilized" (LRU) or "minimum seek" algorithm.