Patent ID: 8782143

Claim:
A computer implemented method, comprising: assigning first, second and third memory areas associated with a computer respective ranks, the first memory area having a highest rank and the third memory area having a lowest rank, each of the first, second and third memory areas being sized to store two or more file segments; receiving, at the computer, a first file segment; storing the first file segment in the first memory area associated with the computer; reassigning a lower rank of the second memory area to the first memory area in response to: receiving a second file segment, and determining that the first memory area is unable to store the second file segment due to being partially full such that an available capacity of the first memory is less than a size of the second file segment; assigning to the third memory area the highest rank previously had by the first memory area in the computer in response to said reassigning the lower rank of the second memory area to the first memory area to make the third memory area available to store the second file segment and the second memory area that is partially full unavailable to store additional file segments; purging the third memory area in its entirety such that two or more file segments previously stored in the third memory area are deleted; and storing the second file segment to the third memory area currently having the highest rank in the computer.