Hi, I am still a much newbie to kernel development,studying schedular of 2.6,Ofcource it has 2 option SCHED_FIFO,SCHED_RR for real time processes , which has got more priority than SCHED_OTHER,and their priorities from 1..100(MAX_RT_PRIO) are shared with other (I.E) with nice value scaled form -19 to 20 to 100 .. 140(MAX_PRIO) I just want to design a rate monotonic scheduling algorithm(HARD real time) Although i know it's difficult to do so,still for newbie .... I know it does'n't require for general purpose linux OS with a O(1) Schedular (it's already give good perfomance for RT processes),But Still want to experiment, Is this is possible? Plz help me,or (the possible it is not practical at all) I just want to know Is it feasible?????? Thanks in advance to ALL __________________________________ Do you Yahoo!? Free Pop-Up Blocker - Get it now http://companion.yahoo.com/ -- Kernelnewbies: Help each other learn about the Linux kernel. Archive: http://mail.nl.linux.org/kernelnewbies/ FAQ: http://kernelnewbies.org/faq/
