$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"

특허 상세정보

RAID-6 computation system and method

국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판) G06F-011/10    G06F-012/16   
미국특허분류(USC) 711/114; 714/006.24; 714/758; 714/759
출원번호 US-0639736 (2009-12-16)
등록번호 US-8296515 (2012-10-23)
발명자 / 주소
출원인 / 주소
대리인 / 주소
    Patterson & Sheridan,LLP
인용정보 피인용 횟수 : 16  인용 특허 : 5
초록

One embodiment of the present invention sets forth a technique for performing RAID-6 computations using simple arithmetic functions and two-dimensional table lookup operations. A set of threads within a multi-threaded processor are assigned to perform RAID-6 computations in parallel on a stripe of RAID-6 data. A set of lookup tables are stored within the multi-threaded processor for access by the threads in performing the RAID-6 computations. During normal operation of a related RAID-6 disk array, RAID-6 computations may be performed by the threads using...

대표
청구항

1. A computer-implemented method for computing erasure codes for a redundant array of independent disks (RAID), the method comprising: storing user data associated with a RAID stripe that is defined by a data block common to each disk in the redundant array, wherein, for each byte offset within the data block, user data associated with only N−2 disks is stored, N being the number of disks in the redundant array, and wherein a sliver comprises a set of S bytes per disk within the RAID stripe at a common sliver offset within each disk;calculating a sliver ...

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

  1. Reinart, John. Combined asynchronous and synchronous fountain code storage in an object store. USP2017109798617.
  2. Sorenson, III, James Christopher; Sieklucki, Mark Robert; Patel, Rajesh Shanker; Rahmany, Dave. Computation refinement in a data storage system. USP20190210198317.
  3. Sieklucki, Mark Robert; Sorenson, III, James Christopher; Patel, Rajesh Shanker; Rahmany, Dave. Computation refinement storage in a data storage system. USP20190210198319.
  4. Madnani, Kiran; Shain, Randall H.; DesRoches, David W.. Data caching system and method. USP2013128612680.
  5. Carpentier, Paul R. M.; Turpin, Russell. Elimination of duplicate objects in storage clusters. USP2014098843454.
  6. Schwaderer, William David. Erasure code data protection and recovery computation system and method. USP20190310230398.
  7. Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David. Erasure coding and replication in storage clusters. USP2018039916198.
  8. Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David. Erasure coding and replication in storage clusters. USP2015099148174.
  9. Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David. Erasure coding and replication in storage clusters. USP2014088799746.
  10. Bennett, John G.; Jenkins, Bob. Locally generated simple erasure codes. USP2016059354991.
  11. Zeng, Yanxing; Shen, Jianqiang; Wang, Gongyi; Zhang, Jinyi; Lv, Wen. Storage controller, data processing chip, and data processing method. USP20190210210044.
  12. Stalzer, Mark A.. Systems and methods for rapid processing and storage of data. USP20190110185655.
  13. Carpentier, Paul R. M.; Turpin, Russell. Two level addressing in storage clusters. USP2018049952918.
  14. Carpentier, Paul R. M.; Turpin, Russell. Two level addressing in storage clusters. USP2015089104560.
  15. Carpentier, Paul R. M.; Turpin, Russell. Two level addressing in storage clusters. USP2017029575826.
  16. Carpentier, Paul R.M.; Turpin, Russell. Two level addressing in storage clusters. USP2015099128833.