From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from sis.com.tw ([203.67.208.2] helo=maillog.sis.com.tw) by pentafluge.infradead.org with esmtp (Exim 3.22 #1 (Red Hat Linux)) id 15fIFr-0006U0-00 for ; Fri, 07 Sep 2001 10:48:55 +0100 Message-ID: <3B989822.DC1D51BE@sis.com.tw> Date: Fri, 07 Sep 2001 17:49:22 +0800 From: Ollie Lho MIME-Version: 1.0 To: David Woodhouse CC: kira brown , Herman Oosthuysen , "'linux-mtd@lists.infradead.org'" Subject: Re: DiskOnChip write performance References: <3B981BF6.24FD764D@sis.com.tw> <14482.999791732@redhat.com> <17891.999850127@redhat.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: linux-mtd-admin@lists.infradead.org Errors-To: linux-mtd-admin@lists.infradead.org List-Help: List-Post: List-Subscribe: , List-Id: Linux MTD discussion mailing list List-Unsubscribe: , List-Archive: David Woodhouse wrote: > > ollie@sis.com.tw said: > > > Don't forget "don't use O(n^3) algorithms when trying to find a new > > > block to write to". > > > What does this suppose to mean ?? > > Algorithms which take time proportional to the cube of 'n', where n is some > variable indicating the complexity of the task - in this case it would be > the number of blocks on the DiskOnChip which are to be considered for > selection. > Yea, I know what Big O is although I am not CompSci graduate. My question is which part of the NFTL code is that bad ?? Ollie