lkml.org 
[lkml]   [1998]   [Nov]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: elevator algorithm bug in ll_rw_blk.c
Hi,

On Sun, 15 Nov 1998 20:38:05 +0100 (MET), Gerard Roudier
<groudier@club-internet.fr> said:

> My understanding of Linux architecture is that IO blocks coalescing only
> occurs in ll_rw_blk.c.

Yes, except for scsi which does its Own Thing, of course.

> If it fails the coalescing then Linux will just do 1 IO for each
> block. When you have lots of memory, it may happen the number of
> entries in the request array (NR_REQUEST) be not enough for this
> coalescing to occur in some situations that may not be rare given the
> way the buffer cache actually work.

The way it actually works, sequential writes tend to be kept in
sequential order in the buffer cache lists, so the typical cases work
pretty well. All the benchmarks show that sequential filesystem writes
work very well.

--Stephen

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:45    [W:0.106 / U:1.500 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site