[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <46ACC76A.3080303@gmail.com>
Date: Sun, 29 Jul 2007 18:59:22 +0200
From: Rene Herman <rene.herman@...il.com>
To: Ray Lee <ray-lk@...rabbit.org>
CC: Alan Cox <alan@...rguk.ukuu.org.uk>, david@...g.hm,
Daniel Hazelton <dhazelton@...er.net>,
Mike Galbraith <efault@....de>,
Andrew Morton <akpm@...ux-foundation.org>,
Ingo Molnar <mingo@...e.hu>,
Frank Kingswood <frank@...gswood-consulting.co.uk>,
Andi Kleen <andi@...stfloor.org>,
Nick Piggin <nickpiggin@...oo.com.au>,
Jesper Juhl <jesper.juhl@...il.com>,
ck list <ck@....kolivas.org>, Paul Jackson <pj@....com>,
linux-mm@...ck.org, linux-kernel@...r.kernel.org
Subject: Re: RFT: updatedb "morning after" problem [was: Re: -mm merge plans
for 2.6.23]
On 07/29/2007 06:04 PM, Ray Lee wrote:
>> I am very aware of the costs of seeks (on current magnetic media).
>
> Then perhaps you can just take it on faith -- log structured layouts
> are designed to help minimize seeks, read and write.
I am particularly bad at faith. Let's take that stupid program that I posted:
http://lkml.org/lkml/2007/7/25/85
You push it out before you hit enter, it's written out to swap, at whatever
speed. How should it be layed out so that it's swapped in most efficiently
after hitting enter? Reading bigger chunks would quite obviously help, but
the layout?
The program is not a real-world issue and if you do not consider it a useful
boundary condition either (okay I guess), how would log structured swap help
if I just assume I have plenty of free swap to begin with?
Rene.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists