Open sandwichdoge opened 3 years ago
At the moment, we use a task list that contains all non-terminated tasks. R/W access time for this list will be O(n) with n = number of running concurrent tasks. Need to make it O(1). Maybe research run queue (Linux 2.6).
http://books.gigatux.nl/mirror/kerneldevelopment/0672327201/ch04lev1sec2.html
sandwichdoge
commented
3 years ago
At the moment, we use a task list that contains all non-terminated tasks. R/W access time for this list will be O(n) with n = number of running concurrent tasks. Need to make it O(1). Maybe research run queue (Linux 2.6).