[Top] [All Lists]

Re: [Ksummit-2005-discuss] Summary of 2005 Kernel Summit Proposed Topics

To: Andrea Arcangeli <andrea@xxxxxxx>
Subject: Re: [Ksummit-2005-discuss] Summary of 2005 Kernel Summit Proposed Topics
From: Rik van Riel <riel@xxxxxxxxxx>
Date: Wed, 30 Mar 2005 10:50:14 -0500 (EST)
Cc: Andi Kleen <ak@xxxxxx>, jamal <hadi@xxxxxxxxxx>, Dmitry Yusupov <dmitry_yus@xxxxxxxxx>, James Bottomley <James.Bottomley@xxxxxxxxxxxxxxxxxxxxx>, mpm@xxxxxxxxxxx, michaelc@xxxxxxxxxxx, open-iscsi@xxxxxxxxxxxxxxxx, ksummit-2005-discuss@xxxxxxxxx, netdev <netdev@xxxxxxxxxxx>
In-reply-to: <20050330154418.GE32111@xxxxxxxxx>
References: <20050326224621.61f6d917.davem@xxxxxxxxxxxxx> <Pine.LNX.4.61.0503272245350.30885@xxxxxxxxxxxxxxxxxxxxxxxxxxx> <m1zmwn21hk.fsf@xxxxxx> <1112027284.5531.27.camel@mulgrave> <20050329152008.GD63268@xxxxxx> <1112116762.5088.65.camel@beastie> <1112130512.1077.107.camel@xxxxxxxxxxxxxxxx> <20050330152208.GB12672@xxxxxx> <20050330153313.GD32111@xxxxxxxxx> <20050330153948.GE12672@xxxxxx> <20050330154418.GE32111@xxxxxxxxx>
Sender: netdev-bounce@xxxxxxxxxxx
On Wed, 30 Mar 2005, Andrea Arcangeli wrote:
> On Wed, Mar 30, 2005 at 05:39:48PM +0200, Andi Kleen wrote:
> > An unsolveable one IMHO. You can just try to be good enough. For that
> I think it's solvable with an algorithm I outlined several emails ago.

Agreed, this is definately solvable.  If people don't agree,
we should probably fight this out at the kernel summit. ;)

"Debugging is twice as hard as writing the code in the first place.
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it." - Brian W. Kernighan

<Prev in Thread] Current Thread [Next in Thread>