| To: | Chaitanya Tumuluri <chait@xxxxxxxxxxxxxxxxxxxx> |
|---|---|
| Subject: | Re: [Fwd: Re: mysterious dbench results] |
| From: | Jens Axboe <axboe@xxxxxxx> |
| Date: | Wed, 21 Feb 2001 01:39:39 +0100 |
| Cc: | Thomas Graichen <graichen@xxxxxxxxxxxxx>, Rajagopal Ananthanarayanan <ananth@xxxxxxx>, linux-xfs@xxxxxxxxxxx |
| In-reply-to: | <Pine.LNX.4.21.0102201617550.6587-200000@xxxxxxxxxxxxxxxxxxxx>; from chait@xxxxxxxxxxxxxxxxxxxx on Tue, Feb 20, 2001 at 04:26:09PM -0500 |
| References: | <3A9308B8.34D66FB3@xxxxxxx> <Pine.LNX.4.21.0102201617550.6587-200000@xxxxxxxxxxxxxxxxxxxx> |
| Sender: | owner-linux-xfs@xxxxxxxxxxx |
On Tue, Feb 20 2001, Chaitanya Tumuluri wrote: > True. So, how about trying out the following patch which is a > first cut at inserting the kiobuf requests in LBA-ordered > fashion in the elevator? > > At the very least, it reduces the seek times which might've been > affecting kiobuf I/O performance adversely. You just further extend what I really don't like about the current approach to kiobuf I/O ;-). It's on huge clamp-on to ll_rw_blk... How about something that doesn't do merges on kiobufs, but just searches for an insertion point exactly like a buffer_head would do? And please don't make elevator_merge_fn even bigger than it already is, within limits of course. BTW, the max_segments is gone from the current tree. -- Jens Axboe |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: [Fwd: Re: mysterious dbench results], Chaitanya Tumuluri |
|---|---|
| Next by Date: | TAKE -, Mark Nordstrand |
| Previous by Thread: | Re: [Fwd: Re: mysterious dbench results], Chaitanya Tumuluri |
| Next by Thread: | Re: [Fwd: Re: mysterious dbench results], Chaitanya Tumuluri |
| Indexes: | [Date] [Thread] [Top] [All Lists] |