About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 36. Chapters: FIFO, Scheduling, Rate-monotonic scheduling, Completely Fair Scheduler, Critical path method, Event chain methodology, Earliest deadline first scheduling, LIFO, Statistical time division multiplexing, Graphical path method, Max-min fairness, Processor affinity, Fair queuing, Round-robin scheduling, Maximum throughput scheduling, Proportionally fair, Elevator algorithm, Brain Fuck Scheduler, Scheduling algorithm, Event chain diagram, CFQ, Linear scheduling method, Generalized processor sharing, Top-nodes algorithm, Gang scheduling, Weighted fair queuing, Two-level scheduling, Activity selection problem, O(1) scheduler, Deadline-monotonic scheduling, Multilevel feedback queue, Deficit round robin, Shortest job next, Time-driven programming, Fair-share scheduling, Interval scheduling, Shortest remaining time, Least slack time scheduling, Weighted round robin, Foreground-background, Shortest seek first, Lottery scheduling, LOOK algorithm, FSCAN, Fixed priority pre-emptive scheduling, Dynamic priority scheduling, Credit-based fair queuing, O(n) scheduler, Windows NT processor scheduling, FINO, Highest response ratio next, Modified due date scheduling heuristic, N-Step-SCAN, Sequence step algorithm, Hierarchical Fair Service Curve, Multilevel queue, List scheduling, Process Contention Scope, Atropos scheduler, Proportional share scheduling. Excerpt: Scheduling is a key concept in computer multitasking, multiprocessing operating system and real-time operating system designs. Scheduling refers to the way processes are assigned to run on the available CPUs, since there are typically many more processes running than there are available CPUs. This assignment is carried out by software known as a scheduler and dispatcher. The scheduler is concerned mainly with: Fairness / Waiting Time - Equal CPU time to each process (or more g...
