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

5.7. Operating system data structures

As main memories have become larger, the criteria for designing OS memory management algorithms have changed. An important factor on modern processors with vast 64-bit virtual address spaces is that the size of the data structures needed to support memory management should depend on the amount of that address space that is in use rather than on its total size. For example, a simple page table holding a mapping for each virtual page would be impracticable at such a size.

Realistic algorithms exploit the fact that a process's pages are allocated in clusters which are widely dispersed in the virtual address space according to software conventions. The UNIX and Windows case studies in Part IV will show how so-called ...

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