linux-kernel - Re: [00/17] Large Blocksize Support V3

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <m1mz0vj60h.fsf@ebiederm.dsl.xmission.com>
Date:	Thu, 26 Apr 2007 13:21:50 -0600
From:	ebiederm@...ssion.com (Eric W. Biederman)
To:	Christoph Lameter <clameter@....com>
Cc:	David Chinner <dgc@....com>, Nick Piggin <nickpiggin@...oo.com.au>,
	linux-kernel@...r.kernel.org, Mel Gorman <mel@...net.ie>,
	William Lee Irwin III <wli@...omorphy.com>,
	Jens Axboe <jens.axboe@...cle.com>,
	Badari Pulavarty <pbadari@...il.com>,
	Maxim Levitsky <maximlevitsky@...il.com>
Subject: Re: [00/17] Large Blocksize Support V3

Christoph Lameter <clameter@....com> writes:

> On Thu, 26 Apr 2007, Eric W. Biederman wrote:
>
>> If you can make small things go fast, everything speeds up.
>> If you can only make big things go fast only some things speed up.
>> 
>> I want to make small things go fast so everything speeds up.
>
> A reductionist operating system theory? Have you ever heard of emergent 
> properties? A system comprised of pieces can as a whole exibit other 
> characteristics than the basic elements would provide.
>
> I think it is wrong to use the same small things for big things. You 
> would not tow a tanker with your bicycle. Similarly you could use small 
> pages for text files but huge page sizes when you need to transfer 
> gigabytes or terabytes of memory. Its wrong to dictate ones size fits 
> all. (Memories of my relatives in the eastern bloc surface but I better shut
> up.)

Think of it like designing a cpu.  Which would you rather have a
faster clock rate or a new instruction say floating point multiply-accumulate
that means you theoretically double your floating point computation speed 
at a cost of reducing your clock rate?

Up to the limit of it being possible you get more bang out of improving
the little things.  CPUs unfortunately pretty much hit the limit of
improving clock rates.

I don't think we are at the limit of making small things like syscalls,
and pages go fast.

Eric
-
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/