Sebastian Huber commented: https://gitlab.rtems.org/rtems/rtos/rtems/-/merge_requests/1164#note_147550 The bitmap based priority queues need a considerable amount of memory and don't work if you have lets say 1000000000 priority levels (for example with the EDF scheduler). In this case you would need hash tables, which don't fit for a supposed to be real-time operating system. I suggest to use the red-black tree based approach which are already used for the thread queues. -- View it on GitLab: https://gitlab.rtems.org/rtems/rtos/rtems/-/merge_requests/1164#note_147550 You're receiving this email because of your account on gitlab.rtems.org.
_______________________________________________ bugs mailing list [email protected] http://lists.rtems.org/mailman/listinfo/bugs
