On Thu, Mar 21, 2019 at 10:29:23AM +0100, Mikhail Morfikov wrote:
>
> Yes, I know that many things can happen during the 128M read. But wecan assume that we have some simplified environment, where we have
> only one disk, one file we want to read at the moment, and we have
> time to do it without any external interferences.
>
> If I understood correctly, as long as the extents reside on a contiguous
> region, they will be read sequentially without any delays, right? So if
> the file in question was one big contiguous region, would it be read
> sequentially from the beginning of the file to its end?
It *could* be read sequentially from the beginning of the file to the
end. There are many things that might cause that not to happen, that
have nothing to do with how we store the logical to physicla map. For
example, some other process might be requested disk reads that might
be interleaved with the reads for that file. If you try to read too
quickly, and the system stalls due to lack of space in the page cache,
that might force some writeback that will interrupt the contiguous
read. The possibilities are endless.
I hesitate to make a categorical statement, because I don't understand
why you are being monomaniacal about this.
> Also I have a question concerning the following sentence[1]:
> "When there are more than four extents to a file, the rest of the
> extents are indexed in a tree."
> Does this mean that only four extents can be read sequentially in a
> file that have only contiguous blocks of data, or because of the
> extent cache, the whole file can be read sequentially anyway?
If you really care about this, it's possible to use the ioctl
EXT4_IOC_PRECACHE_EXTENTS which will read the extent tree and cache it
in the extent status cache. The main use for this has been people who
want to make a really big file --- for example, it's possible to
create a single 10 TB file which is contiguous, and while the on-disk
extent tree might require a number of 4k blocks, it can be cached in a
single 12 byte extent status cache entry.
The primary use case for this ioctl is for a *random* read workload if
there is a requirement for tail latencies. For certain workloads,
such as a distributed query of hundreds of disks to satisfy a single
search query, if a single read is slow, it will slow down the ability
to satisfy the entire search query. To avoid that, people will worry
about the 99th or even 99.9th percentile random read latency. And so
precaching the extent tree makes sense:
3. Fast is better than slow.
We know your time is valuable, so when you’re seeking an answer on
the web you want it right away–and we aim to please. We may be the
only people in the world who can say our goal is to have people
leave our website as quickly as possible. By shaving excess bits
and bytes from our pages and increasing the efficiency of our
serving environment, we’ve broken our own speed records many times
over, so that the average response time on a search result is a
fraction of a second....
- https://www.google.com/about/philosophy.html
But for a sequential read workload --- it really makes no sense to be
worried about this. For example, if you are doing a streaming video
read, the need to seek to to read from the extent status tree is not
going to be noticed at all. A HD video stream is roughly 100MB /
minute. So once the system realizes that you are doing a sequential
read, read-ahead will automatically start pulling in new blocks ahead
of the video stream, and the need to seek to read the extent status
tree will be invisible. And if you are copying the file, the
percentage increase for periodically seeking to read in the extent
status tree is going to be so small it might not even be measurable.
Which is why I'm really puzzled why you care.
- Ted
