Skip to 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
912 pages
27h 17m
English
Pearson Business
Content preview from Operating Systems: Concurrent and Distributed Software Design

4.5. The process data structure

The operating system must handle many processes and will maintain a data structure holding their descriptors. This could be set up in a number of ways. The aim is that the operating system should be able to choose and run the highest-priority process as quickly as possible. Selecting a process to run on a processor is called process scheduling. The selection policy determines which process will be selected and is effected by the scheduling algorithm. Setting up a process state in the processor's registers is called dispatching. Figure 4.7 shows one possible data structure: an array or table of process descriptors; many alternatives are possible.

Figure 4.7. A possible process structure.
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

Operating System Design, 2nd Edition

Operating System Design, 2nd Edition

Douglas Comer
Operating Systems in Depth

Operating Systems in Depth

Thomas W. Doeppner

Publisher Resources

ISBN: 0321117891Purchase book