On Friday 19 June 2009 12:19:03 Cathey, Jim wrote: > >IMHO the right way is to start thinking about a parallel algorithm > > using > > >the MP option of gcc. The example above has two potential bottlenecks > >1. the read-from-media 2. calc md5 > >depending on your system you may have the one or other or both. > > Running "md5sum -cs" the first time is 14 seconds, the second > time is 3.5 seconds.
"cat $FILELIST > /dev/null &" will prepopulate your cache for you, and should do it on a separate processor from the md5sum process. (I take it this is jffs2 log reassembly and decompression?) Rob -- Latency is more important than throughput. It's that simple. - Linus Torvalds _______________________________________________ busybox mailing list [email protected] http://lists.busybox.net/mailman/listinfo/busybox
