Re:Finger Trees: A Simple General-Purpose Data Structure (2006)
by scott_s on Tuesday December 27, 2016 @10:58AM
(#13263841)
Is this your understanding from intuition, or are you aware of kernel developers who have made this same argument?
[ Parent
| on HN ]
Re:Finger Trees: A Simple General-Purpose Data Structure (2006)
by geocar on Tuesday December 27, 2016 @11:41AM
(#13264118)
Not sure exactly what you're asking.
We can evaluate the Linux kernel developers' priorities by benchmarking[1] and assuming they aren't stupid, because if they are stupid, then their opinion doesn't matter, and if they're not and they're not making things faster, then it's because they have other priorities.
That being said, there are a few[2] notable[3] moves away from linked lists that were ostensibly for performance reasons.
[1]: Even crap benchmarks: http://www.phoronix.com/scan.php?page=article&item=linux-44-...
Re:Finger Trees: A Simple General-Purpose Data Structure (2006)
by scott_s on Tuesday December 27, 2016 @12:08PM
(#13264325)
You provided a reason for why the kernel does a certain thing (easier to code; performance in those places doesn't matter). I was asking if this was your understanding based on inference (your understanding of the performance trade offs in general combined with the fact things are done a certain way) or from fact (claims made directly by kernel developers, or experiments).