I was browsing through the Linux kernel source a while back and found linked lists being used for the run queue in the scheduler. It seems that the scheduler has to go through the entire run queue to find an appropriate process to execute. I'm planning to do some experiments/kernel hacking on the scheduler to make it more efficient on SMP systems and I'd like to know if there is a particular reason why a linked list is used instead of a heap. In this situation I think a heap would be much more efficient than a linked list. Johnny - Linux SMP list: FIRST see FAQ at http://www.irisa.fr/prive/mentre/smp-faq/ To Unsubscribe: send "unsubscribe linux-smp" to [EMAIL PROTECTED]
