Skip to Main Content
Operating Systems: Concurrent and Distributed Software Design
book

Operating Systems: Concurrent and Distributed Software Design

by Jean Bacon, Tim Harris
March 2003
Intermediate to advanced content levelIntermediate to advanced
912 pages
27h 17m
English
Pearson Business
Content preview from Operating Systems: Concurrent and Distributed Software Design

4.6. Scheduling: General approaches

When a free processor is available the operating system must select a runnable process (if one exists) to run on it. The scheduling policy of the system deter mines which process is selected.

The mechanisms to effect this policy must be as efficient as possible since they are an overhead on every process, however urgent. The design of the data structures representing processes and the algorithms for inserting and removing processes into and out of them is therefore important. In this section, scheduling policies appropriate for meeting the requirements of systems of different types are discussed.

4.6.1. Unary, binary and general scheduling

In certain cases the selection of the next process to run can be simplified. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Principles of Concurrent and Distributed Programming, Second Edition

Principles of Concurrent and Distributed Programming, Second Edition

M. Ben-Ari
Operating Systems in Depth

Operating Systems in Depth

Thomas W. Doeppner

Publisher Resources

ISBN: 0321117891Purchase book