I am trying to implement a completely fair scheduler. I want to know how to calculate the initial value of virtual run time of a process in order to insert the process into a red black tree
$\begingroup$
$\endgroup$
4
-
2$\begingroup$ Hey Dasun. This isn't a good question for cs.stackexchange because this site is mainly for algorithmic and theoretical questions, and your question seems specific to Linux. I also am not entirely sure there is enough detail to understand what you are asking, but I think you could try unix.stackexchange.com $\endgroup$ – 6005 Mar 2 '20 at 4:57
-
1$\begingroup$ I suspect it would be on-topic here if it wasn't limited to Linux. $\endgroup$ – D.W.♦ Mar 2 '20 at 8:06
-
$\begingroup$ @D.W., it is a question on how a specific program works... $\endgroup$ – vonbrand Mar 3 '20 at 14:34
-
$\begingroup$ You'd have to check how the code of the exact Linux verion you have in mind does it. There is no "general formula" for anything like this. $\endgroup$ – vonbrand Mar 4 '20 at 0:28
Add a comment
|
