Operating Systems: Three Easy Pieces学习笔记 - Virtualization - The Abstraction: Address Spaces

The Abstraction: Address Spaces

Early Systems

The OS was a set of routines that sat in memory, and there would be one running program that currently sat in physical memory and used the rest of memory.


image.png

Multiprogramming and Time Sharing

Leave processes in memory while switching between them, allowing the OS to implement time sharing efficiently. Each of the processes have a small part of the 512-KB physical memory carved out for them. With multiple programs residing concurrently in memory, protection becomes an important issue.

image.png

The Address Space

The OS creates an easy to use abstraction of physical memory called the address space, which is the running program's view of memory in the system.
The address space of a process contains all of the memory state of the running program, like the code, stack and heap.

image.png

Notice in Figure 13.3, the heap and the stack are placed at the opposite ends of the address space so that they just have to grow in opposite directions.
The program really isn't in memory at physical addresses 0 through 16KB; rather it is loaded at some arbitrary physical addresses.
Crux: How to virtualize memory?
We say the OS is virtualizing memory because the running program thinks it is loaded into memory at a particular address (say 0) and has a potentially very large address space (say 32-bits or 64-bits).
When process A in Figure 13.2 tries to perform a load at address 0 (which we call a virtual address), the OS, in tandem with some hardware support, will make sure that the load doesn't actually go to physical address 0 but rather to physical address 320KB (where A is loaded into memory).

Goals

  1. Transparency: The OS should implement virtual memory in a way that is invisible to the running program
  2. Efficiency: The OS should strive to make the virtualization as efficient as possible, both in terms of time and space
  3. Protection: The OS should make sure to protect processes from one another as well the OS itself from processes. Protection enables us to deliver the property of isolation among processes; each process should be running in its own isolated cocoon

Memory API

Crux: How to allocate and manage memory?

Types of Memory

In running a C program, there are two types of memory that are allocated.
The first is called stack memory, and allocations and deallocations of it are managed implicitly by the compiler for the programmer; for this reason it is also called automatic memory. The program, while it is running, uses a stack to keep track of where it is in the function call chain as well as to allocate local variables and pass parameter and return values to and from routines.
The second is called heap memory, where all allocations and deallocations are explicitly handled by the programmer. The heap is used for dynamically-allocated, user-managed memory, such as a call to malloc() in C or new in C++ or Java. The heap also contains statically-initialized variables.

The malloc() Call

Pass it a size asking for some room on the heap, and it either succeeds and gives back a pointer to the newly-allocated space, or fails and returns NULL.

The free() Call

To free heap memory that is nolong in use, call free().
The routine takes one argument, a pointer that was returned by malloc().

Underlying OS Support

malloc() and free() are not system calls, but rather library calls. However, they are built on top of some system calls.
brk is a system call that is used to change the location of the program's break: the location of the end of the heap. It takes one argument (the address of the new break), and thus either increases or decreases the size of the heap based on whether the new break is larger or smaller than the current break.
You can obtain memory from the operating system via the mmap() call. By passing in the correct arguments, mmap() can create an anonymous memory region within the program - a region which is not associated with any particular file but rather with swap space.

Other Calls

calloc() allocates memory and also zeroes it before returning.
realloc() makes a new larger region of memory, copies the old region into it, and returns the pointer to the new region.

最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
  • 序言:七十年代末,一起剥皮案震惊了整个滨河市,随后出现的几起案子,更是在滨河造成了极大的恐慌,老刑警刘岩,带你破解...
    沈念sama阅读 211,948评论 6 492
  • 序言:滨河连续发生了三起死亡事件,死亡现场离奇诡异,居然都是意外死亡,警方通过查阅死者的电脑和手机,发现死者居然都...
    沈念sama阅读 90,371评论 3 385
  • 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
    开封第一讲书人阅读 157,490评论 0 348
  • 文/不坏的土叔 我叫张陵,是天一观的道长。 经常有香客问我,道长,这世上最难降的妖魔是什么? 我笑而不...
    开封第一讲书人阅读 56,521评论 1 284
  • 正文 为了忘掉前任,我火速办了婚礼,结果婚礼上,老公的妹妹穿的比我还像新娘。我一直安慰自己,他们只是感情好,可当我...
    茶点故事阅读 65,627评论 6 386
  • 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
    开封第一讲书人阅读 49,842评论 1 290
  • 那天,我揣着相机与录音,去河边找鬼。 笑死,一个胖子当着我的面吹牛,可吹牛的内容都是我干的。 我是一名探鬼主播,决...
    沈念sama阅读 38,997评论 3 408
  • 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
    开封第一讲书人阅读 37,741评论 0 268
  • 序言:老挝万荣一对情侣失踪,失踪者是张志新(化名)和其女友刘颖,没想到半个月后,有当地人在树林里发现了一具尸体,经...
    沈念sama阅读 44,203评论 1 303
  • 正文 独居荒郊野岭守林人离奇死亡,尸身上长有42处带血的脓包…… 初始之章·张勋 以下内容为张勋视角 年9月15日...
    茶点故事阅读 36,534评论 2 327
  • 正文 我和宋清朗相恋三年,在试婚纱的时候发现自己被绿了。 大学时的朋友给我发了我未婚夫和他白月光在一起吃饭的照片。...
    茶点故事阅读 38,673评论 1 341
  • 序言:一个原本活蹦乱跳的男人离奇死亡,死状恐怖,灵堂内的尸体忽然破棺而出,到底是诈尸还是另有隐情,我是刑警宁泽,带...
    沈念sama阅读 34,339评论 4 330
  • 正文 年R本政府宣布,位于F岛的核电站,受9级特大地震影响,放射性物质发生泄漏。R本人自食恶果不足惜,却给世界环境...
    茶点故事阅读 39,955评论 3 313
  • 文/蒙蒙 一、第九天 我趴在偏房一处隐蔽的房顶上张望。 院中可真热闹,春花似锦、人声如沸。这庄子的主人今日做“春日...
    开封第一讲书人阅读 30,770评论 0 21
  • 文/苍兰香墨 我抬头看了看天上的太阳。三九已至,却和暖如春,着一层夹袄步出监牢的瞬间,已是汗流浃背。 一阵脚步声响...
    开封第一讲书人阅读 32,000评论 1 266
  • 我被黑心中介骗来泰国打工, 没想到刚下飞机就差点儿被人妖公主榨干…… 1. 我叫王不留,地道东北人。 一个月前我还...
    沈念sama阅读 46,394评论 2 360
  • 正文 我出身青楼,却偏偏与公主长得像,于是被迫代替她去往敌国和亲。 传闻我的和亲对象是个残疾皇子,可洞房花烛夜当晚...
    茶点故事阅读 43,562评论 2 349

推荐阅读更多精彩内容