A. Many blocks that have recently been written to storage by the compute system are retrieved and placed in cache. - NO// WRITE, MUST BE READ
B. Many non-contiguous blocks that are not currently required can be retrieved from cache in advance. - NO // Must to be contiguos
C. Storage system prefetches data in multiples of the original I/O request size from the compute system. - MOST ACCURATE - SO C for ME
D. Storage system prefetches many non-contiguous blocks of data, with varied sizes, from cach - NO // Must to be contiguos
Prefetch: A prefetch or read-ahead algorithm is used when read requests are sequential. In a sequential read request, a contiguous set of associated blocks is retrieved. Several other blocks that have not yet been requested by the compute system can be read from the storage and placed into cache in advance. When the compute system subsequently requests these blocks, the read operations will be read hits. This process significantly improves the response time experienced by the compute system
Must be "C"
"The intelligent storage system offers fixed and variable prefetch sizes. In fixed prefetch, the intelligent storage system prefetches a fixed amount of data. It is most suitable when host I/O sizes are uniform. << In variable prefetch, the storage system prefetches an amount of data in "multiples of the size of the host request". >> Maximum prefetch limits the number of data blocks that can be prefetched to prevent the disks from being rendered busy with prefetch at the expense of other I/Os.
Information Storage and Management . Wiley. Kindle Edition.
From ISM v4 -> Prefetch: A prefetch or read-ahead algorithm is used when read requests are
sequential. In a sequential read request, a contiguous set of associated blocks is
retrieved. Several other blocks that have not yet been requested by the compute
system can be read from the storage and placed into cache in advance. When the
compute system subsequently requests these blocks, the read operations will be
read hits. This process significantly improves the response time experienced by the
compute system.
https://forum.huawei.com/enterprise/en/corpus-12891.html
1. After receiving a data read request, the storage system prefetches data to the cache based on a multiple of the read length specified in the I/O request.
2. This policy applies to sequential read applications with variable-size data or to multi-user concurrent read applications with an unknown data prefetch amount, for example, multi-user Video on Demand (VOD) initiated by users at different bit rates.
C is correct.
A prefetch or read-ahead algorithm is used when read requests are sequential. In a sequential read request, a contiguous set of associated blocks is retrieved. Several other blocks that have not yet been requested by the compute system can be read from the storage and placed into cache in advance. When the compute system subsequently requests these blocks, the read operations will be read hits. This process significantly improves the response time experienced by the compute system.
- Since it's a variable prefetch then D is correct.
Cache prefetching
The EMC read-prediction algorithm—also known as read-ahead
caching or prefetching—is adaptive in nature. The SP will prefetch
data (assuming prefetching is enabled for the corresponding LUN)
and fill the read cache only after two sequential reads that share
spatial locality. By using this algorithm, the SP assumes that if there
were two reads from the same location, there is a high probability
that it will need that data from the next sequential location again.
The SP will first check the read cache for the data. If the data is not
present, it will then check the disk. This algorithm can help reduce
SP-to-LUN latency by filling the read cache with prefetched data before
it is actually needed.
I actually think it is B, or maybe D. But maybe I am understanding this question wrong but here is what I found:
Prefetch: A prefetch or read-ahead algorithm is used when read requests are sequential. In a sequential read request, a contiguous set of associated blocks is retrieved. Several other blocks that have not yet been requested by the compute system can be read from the storage and placed into cache in advance. When the compute system subsequently requests these blocks, the read operations will be read hits. This process significantly improves the response time experienced by the compute system.
A voting comment increases the vote count for the chosen answer by one.
Upvoting a comment with a selected answer will also increase the vote count towards that answer by one.
So if you see a comment that you already agree with, you can upvote it instead of posting a new comment.
JBONINO
Highly Voted 3 years, 10 months agoBadr0093
Most Recent 3 months, 3 weeks agoNaelOsama
2 years, 8 months agoIvan_Miran
3 years, 1 month agomozgachev
3 years, 3 months agowalther32
3 years, 3 months agoTyrion0097
3 years, 4 months agosheym
3 years, 11 months agokens
3 years, 11 months agokunalgupta
4 years, 1 month agoJamestyler22
4 years, 2 months agofarquar
3 years, 12 months agohakot
4 years, 3 months agomathmad
4 years, 5 months ago