[특허]Content addressable storage array element

NetApp, Inc.

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

특허 상세정보

MyON담기

내보내기

Content addressable storage array element

국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G06F-007/00 G06F-017/00
미국특허분류(USC)	707/696; 707/698
출원번호	UP-0340308 (2006-01-26)
등록번호	US-7734603 (2010-06-29)
발명자 / 주소	McManis, Charles
출원인 / 주소	NetApp, Inc.
대리인 / 주소	Cesari and McKenna LLP
인용정보	피인용 횟수 : 87 인용 특허 : 30

초록
▼

A content addressable storage array element (CASAE) of a storage system is configured to eliminate duplicate data stored on its storage resources. The CASAE independently determines whether data associated with a write operation has already been written to a location on its storage resources. To that end, the CASAE performs a content addressable storage computation on each data block written to those resources in order to prevent storage of two or more blocks with the same data. If data of a block has been previously stored on the resources, the CASAE cooperates with a file system executing on the system to provide a reference (block pointer) to the same data block rather than duplicate the stored data. Otherwise, the CASAE stores the data block at a new location on the resources and provides a block pointer to that location.

대표
청구항
▼

What is claimed is: 1. A method for managing storage resources of a storage system, the method comprising: performing, on a remote storage array at the logical unit level, a content addressable storage computation to compute a key from content of a first data block in response to receiving a client request to write the first data block to the storage system; comparing, on the remote storage array, the computed key with keys of entries in a mapping table to determine if there is a match; in response to determining there is a match, comparing, on the remote storage array, the content of the first data block with content of a second data block previously stored on the resources of the remote storage array; and in response to determining that the comparison of the data block contents results in a match, incrementing a reference count on the previously stored data block, cooperating with a file system executing on the storage system to provide the storage system with a physical block number of the second data block to the storage system rather than storing duplicate data block contents on the storage resources of the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 2. The method of claim 1, further comprising: if one of the keys do not match and the data block contents do not match: writing the first data block to a next available block location on the storage resources; and providing a block number of the next available location to the storage system. 3. The method of claim 1, further comprising: computing the key using a hash function. 4. A computer system configured for managing storage resources of a storage system, comprising: a remote content addressable storage array element configured to compute, on a remote storage array at the logical unit level by a processor, a key based on content of a first data block in response to receiving a client request to write the first data block to the storage device, determine whether the key has been generated for a second data block previously stored on the resources, if so compare, on the remote storage array, the data block contents of the remote storage array, if there is a match increment a reference count on the previously stored data block and cooperate with a file system executing on the storage system to provide the storage system with a physical block number of the second data block to the storage system rather than writing the first data block to the storage device; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 5. The system of claim 4, further comprising: the physical block number is a physical block number of a logical unit stored on the storage resources. 6. The system of claim 4, further comprising: if one of the key has not been generated for the second data block previously stored on the resources, the content addressable storage array element is further configured to write the first data block to a next available block location on the storage resources and return a block number of the next available location to a storage system coupled to the element. 7. The system of claim 4, further comprising: the key is computed using a hash function. 8. The system of claim 7, further comprising: the hash function is a MD5 hashing algorithm. 9. The system of claim 4, further comprising: a mapping data structure used by the content addressable storage array element to determine whether the key has been generated for the second data block. 10. The system of claim 9, further comprising: the mapping data structure is a table having a plurality of entries, each entry containing a hash key, a pointer configured to reference a data block previously stored on the storage resources and a reference count. 11. The system of claim 4, further comprising: the content addressable storage array element is further configured to prevent storage of duplicate data block contents on the storage resources. 12. An apparatus configured to manage storage resources of a storage system, the apparatus comprising: performing, by a processor, at the logical unit level, a content addressable storage computation to compute a key from content of a first data block in response to receiving a client request to write the first data block to the storage system; means for comparing the computed key with keys of entries in a mapping table to determine if there is a match; in response to determining that there is a match, means for comparing the content of the first data block with content of a second data block previously stored on the resources of a remote storage array; in response to determining the comparison of the data block contents results in a match, means for incrementing a reference count on the previously stored data block, and means for cooperating with a file system executing on the storage system to provide the storage system with a physical block number of the second data block to the storage system rather than storing duplicate data block contents on the storage resources of the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 13. The apparatus of claim 12, further comprising: if one of the keys do not match and the data block contents do not match: means for writing the first data block to a next available block location on the storage resources; and means for providing a block number of the next available location to the storage system. 14. The apparatus of claim 12, further comprising: means for computing the key using a hash function. 15. A computer readable medium containing executable program instructions executed by a processor, comprising: program instructions that perform, on a remote storage array at the logical unit level, a content addressable storage computation to compute a key from content of a first data block in response to receiving a client request to write the first data block to the storage system; program instructions that compare, on the remote storage array, the computed key with keys of entries in a mapping table to determine if there is a match; program instructions that compare, on a remote storage array, the content of the first data block with content of a second data block previously stored on the resources in response to determining that there is a match, comparing; program instructions that, in response to determining that the comparison of the data block contents results in a match, increment a reference count on the previously stored data block and cooperate with a file system executing on the storage system to provide the storage system with a physical block number of the second data block to the storage system rather than storing duplicate data block contents on the storage resources of the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 16. The computer readable medium of claim 15, further comprising: if one of the keys do not match and the data block contents do not match, one or more program instructions for: writing the first data block to a next available block location on the storage resources; and providing a block number of the next available location to the storage system. 17. The computer readable medium of claim 15, further comprising: computing the key using a hash function. 18. A method for managing storage resources of a storage system, the method comprising: receiving from a storage system a write request at a content addressable storage array element (CASAE), the CASAE coupled to a plurality of disks of a remote storage array, the remote storage array configured to store user data of a data container served by the storage system; performing, on the remote storage array at the logical unit level, a content addressable storage computation, the computation resulting in a key computed from content of a first data block; comparing, on the remote storage array, the computed key with a plurality of previously generated keys to determine if there is a match, the previously generated keys associated with previously stored data blocks; in response to determining that there is a match, comparing the content of the first data block with content of a second data block previously stored on the remote storage array and in response to determining that the comparison of the data block contents results in a match, incrementing a reference count on the previously stored data block, and cooperating with a file system executing on the storage system to provide the storage system with a physical block number of the second data block to the storage system rather than storing duplicate data block contents on the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 19. The method of claim 18, further comprising: if one of the previously generated keys do not match and the data block contents do not match: writing the first data block to a next available block location on the remote storage array; and providing a block number of the next available location to the storage system. 20. The method of claim 18, further comprising: computing the key using a hash function. 21. A method for managing a storage system, comprising: receiving a write request to write a first data block to a remote storage array; computing, on the remote storage array at the logical unit level, a hash key of the first data block; comparing, on the remote storage array, the hash key of the first data block with previously computed hash keys of stored data blocks, the stored data blocks stored in the remote storage array; in the event that the hash key of the first data block does not match any of the previously computed hash keys, storing the first data block to the remote storage array; in the event that the hash key of the first data block does match a previously computed hash key; comparing, on the remote storage array, the first data block with one or more stored data blocks associated with the previously computed hash key; in the event that the first data block matches one of the one or more data blocks associated with the previously computed hash key, cooperating with a file system executing on the storage system to provide the storage system with a physical block number of a stored data block associated with the previously computed hash key to the storage system; updating a pointer to a location of the stored data block; in the event that the first data block does not match the one or more stored data blocks associated with the previously computed hash key, storing the first data block to the storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 22. A system for managing a storage system, comprising: a write request to write a first data block to a remote storage array; a processor on a content addressable storage array element, to compute, at the logical unit level, a hash key of the first data block; the processor to compare the hash key of the first data block with previously computed hash keys of stored data blocks, the stored data blocks stored in the remote storage array; in the event that the hash key of the first data block does not match any of the previously computed hash keys, the processor to store the first data block to the remote storage array; in the event that the hash key of the first data block does match a previously computed hash key; the processor to compare, on the remote storage array, the first data block with one or more stored data blocks associated with the previously computed hash key; in the event that the first data block matches one of the one or more data blocks associated with the previously computed hash key, the processor to cooperate with a file system executing on the storage system to provide the storage system with a physical block number of a stored data block associated with the previously computed hash key to the storage system; the processor to update a pointer to a location of the stored data block; in the event that the first data block does not match the one or more stored data blocks associated with the previously computed hash key, the processor to store the first data block to the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays. 23. A computer readable medium containing executable program instructions executed by a processor, comprising: program instructions that receive a write request to write a first data block to a remote storage array; program instructions that compute, on the remote storage array at the logical unit level, a hash key of the first data block; program instructions that compare, on the remote storage array, the hash key of the first data block with previously computed hash keys of stored data blocks, the stored data blocks stored in the storage array; program instructions that, in the event that the hash key of the first data block does not match any of the previously computed hash keys, store the first data block to the remote storage array; program instructions that, in the event that the hash key of the first data block does match a previously computed hash key; compare, on the remote storage array, the first data block with one or more stored data blocks associated with the previously computed hash key; in the event that the first data block matches one of the one or more data blocks associated with the previously computed hash key, cooperate with a file system executing on the storage system to provide the storage system with a physical block number of a stored data block associated with the previously computed hash key to the storage system; update a pointer to a location of the stored data block; in the event that the first data block does not match the one or more stored data blocks associated with the previously computed hash key, store the first data block to the remote storage array; and wherein the remote storage array operates in parallel with one or more additional remote storage arrays to allow aggregation of resources among the remote storage arrays, the parallel operation performing content addressable storage computations associated with the write operations on each of the one or more remote storage arrays.

이 특허에 인용된 특허 (30)

이 특허를 인용한 특허 피인용횟수: 87

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

특허 상세정보

Content addressable storage array element

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (30)

이 특허를 인용한 특허 피인용횟수: 87

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

특허 상세정보

Content addressable storage array element

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (30)

이 특허를 인용한 특허 피인용횟수: 87

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼