Use binomial heaps as priority queues.

The list-based priority queues did not perform well on the Niagara T2000.
This heap-based implementation should perform much faster when queues
are long.

1 files changed, 0 insertions, 5 deletions

diff --git a/include/linux/sched.h b/include/linux/sched.h
index 9541cc8fe8..76e28f19e9 100644
--- a/include/linux/sched.h
+++ b/include/linux/sched.h
@@ -1187,11 +1187,6 @@ struct task_struct {
         /* litmus parameters and state */
         struct rt_param rt_param;
 
-        /* allow scheduler plugins to queue in release lists, etc.
-         * Cleanup: Move this into the rt_param struct.
-         */
-        struct list_head rt_list;
-
         /* references to PI semaphores, etc. */
         struct od_table_entry* od_table;
 };