Revision as of 14:55, 8 February 2006 edit Vstarre (talk \| contribs) 86 edits If linux doesnt use this scheduler, Linux has nothing to do with this scheduler. No point in putting a whole new section just to say "this section is irrelevent" :) ← Previous edit		Revision as of 14:49, 29 April 2006 edit undo Thomas Blomberg (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 13,958 edits mNo edit summary Next edit →
Line 1: '''Two-level scheduling''' is a [[~~Computer~~computer science]] term to describe a method to more efficiently perform process [[Scheduling (computing)\|scheduling]] that involves [[swapped out]] [[process (computing)\|processes]]. Consider this problem: A system contains 50 running processes all with equal priority. However, the system's [[computer storage\|memory]] can only hold 10 processes in memory simultaneously. Therefore, there will always be 40 processes swapped out written on [[virtual memory]] on the [[hard disk]]. The time taken to swap out and swap in a process is 50 ms respectively.

Two-level scheduling: Difference between revisions