Re: elevator algorithm bug in ll_rw_blk.c

Benjamin Redelings I (bredelin@ucsd.edu)
Sat, 14 Nov 1998 14:35:37 -0800

For good best AND worst case performance, there are algorithms that
where developed for a fusion of heapsort and quicksort. In the simplest
algorithm I think you just switch to heapsort if it takes longer than
some fixed.

But that would be a more complex algorithm to implement and maintain;
also it would take more RAM...

-BenRI

-- 
If E. Coli was a computer:
 "OPERON.DLL: Mutation in LACTOSE.DLL.  Entire system halted."


Benjamin Redelings I       <><      http://sdcc13.ucsd.edu/~bredelin


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/