Messages in this thread | | | Date | Mon, 22 Mar 2004 01:46:52 +0100 | From | Andrea Arcangeli <> | Subject | Re: [RFC][PATCH 1/3] radix priority search tree - objrmap complexity fix |
| |
On Sun, Mar 21, 2004 at 05:10:45PM -0500, Rajesh Venkatasubramanian wrote: > http://marc.theaimsgroup.com/?l=linux-kernel&m=107966438414248 > > Andrea says the system may hang, however, in this case system > does not hang.
It's a live lock, not a deadlock. I didn't wait more than a few minutes every time before declaring the kernel broken and rebooting the machine. still if the prio_tree fixed my problem it means at the very least it reduced the contention on the locks a lot ;)
It would be curious to test it after changing the return 1 to return 0 in the page_referenced trylock failures?
the results looks great, thanks.
what about the cost of a tree rebalance, is that O(log(N)) like with the rbtrees? - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |