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

25.5. Memory management

Chapter 24 showed how each process in a classical UNIX system comprises three logical segments, one holding its text (code), one holding its data (including the heap) and the third holding the stack. When the fork system call was used to create a process the child would share its text segment with the parent and would have its data and stack segments initialized with copies of its parent's current state. We assumed that hardware-supported paging or segmentation would operate, as described in Chapter 5, to map those logical segments onto physical memory.

In this section we examine how the use of memory has developed in contemporary UNIX systems, both in terms of how the logical address space of a process is constructed ...

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