Date: Thu, 15 Mar 2007 09:34:10 -0400 (EDT) From: Garrett Wollman <wollman@khavrinen.csail.mit.edu> To: dds@aueb.gr Cc: arch@freebsd.org Subject: Re: Multithreaded qsort(3) Message-ID: <200703151334.l2FDYAfo024194@khavrinen.csail.mit.edu> In-Reply-To: <45F906ED.8070100@aueb.gr>
next in thread | previous in thread | raw e-mail | index | archive | help
In <45F906ED.8070100@aueb.gr> you write: >$ qsort_mt -t -h 2 -n 100000000 -l # Integers; qsort(3) >46.5 46.2 0.314 >$ ./qsort_mt -t -h 2 -n 100000000 # Integers; qsort_mt >27.5 46.3 0.301 "fancy algorithms have large constants, and N is usually small". Do you have any reason to believe that N is large with sufficient frequency to justify the overhead? -GAWollman
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200703151334.l2FDYAfo024194>