Linux Scheduling o Two algorithms:time-sharing and real-time o Time-sharing Prioritized credit-based-process with most credits is scheduled next Credit subtracted when timer interrupt occurs When credit =0,another process chosen 的 When all processes have credit =0,recrediting occurs oBased on factors including priority and history o Real-time Soft real-time Posix.1b compliant-two classes oFCFS and RR o Highest priority process always runs firstLinux Scheduling  Two algorithms: time-sharing and real-time  Time-sharing  Prioritized credit-based – process with most credits is scheduled next  Credit subtracted when timer interrupt occurs  When credit = 0, another process chosen  When all processes have credit = 0, recrediting occurs Based on factors including priority and history  Real-time  Soft real-time  Posix.1b compliant – two classes FCFS and RR Highest priority process always runs first