On Tue, Jan 08, 2013 at 11:15:37AM -0500, Jeff Moyer wrote: > Kent Overstreet <koverstreet@xxxxxxxxxx> writes: > > > On Tue, Jan 08, 2013 at 10:33:18AM -0500, Jeff Moyer wrote: > >> Kent Overstreet <koverstreet@xxxxxxxxxx> writes: > >> > >> >> Is the rbtree really faster than a basic (l)list and a sort before > >> >> completing them? Would be simpler. > >> > > >> > Well, depends. With one or two kioctxs? The list would definitely be > >> > faster, but I'm loathe to use an O(n^2) algorithm anywhere where the > >> > input size isn't strictly controlled, and I know of applications out > >> > there that use tons of kioctxs. > >> > >> Out of curiosity, what applications do you know of that use tons of > >> kioctx's? > > > > "tons" is relative I suppose, but before this patch series sharing a > > kioctx between threads was really bad for performance and... you know > > how people can be with threads. > > I wasn't questioning the merits of the patch, I was simply curious to > know how aio is being (ab)used in the wild. So, is this some internal > tool, then, or what? Oh, didn't think you were, I just never looked for actual numbers. Yeah, some internal library code is what I was referring to, but from the story of how it evolved I don't think it's unusual. -- To unsubscribe from this list: send the line "unsubscribe linux-fsdevel" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
