US 12,346,201 B2
Efficient redundant array of independent disks (RAID) stripe parity calculations
Constantine Sapuntzakis, Palo Alto, CA (US); Marco Sanvido, Belmont, CA (US); and Timothy Brennan, San Francisco, CA (US)
Assigned to PURE STORAGE, INC., Santa Clara, CA (US)
Filed by PURE STORAGE, INC., Santa Clara, CA (US)
Filed on Jul. 7, 2023, as Appl. No. 18/348,876.
Application 18/348,876 is a continuation of application No. 17/864,072, filed on Jul. 13, 2022, granted, now 11,714,718.
Application 17/864,072 is a continuation of application No. 17/112,481, filed on Dec. 4, 2020, granted, now 11,392,456, issued on Jul. 19, 2022.
Application 17/112,481 is a continuation of application No. 16/573,571, filed on Sep. 17, 2019, granted, now 10,891,192, issued on Jan. 12, 2021.
Application 16/573,571 is a continuation of application No. 15/697,566, filed on Sep. 7, 2017, granted, now 10,417,092, issued on Sep. 17, 2019.
Prior Publication US 2023/0350751 A1, Nov. 2, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 11/10 (2006.01); G06F 3/06 (2006.01)
CPC G06F 11/1076 (2013.01) [G06F 3/061 (2013.01); G06F 3/0619 (2013.01); G06F 3/064 (2013.01); G06F 3/065 (2013.01); G06F 3/0665 (2013.01); G06F 3/067 (2013.01); G06F 3/0688 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving a portion of a redundant array of independent disks (RAID) stripe;
generating a parity value based on a parity calculation that uses the received portion of the RAID stripe and a previously calculated parity value without using a previous portion of the RAID stripe; and
replacing a previous parity value with the parity value at a memory location.