[Operating System] {ud923} P2L1: Processes and Process Management

博客介绍了进程地址空间,其最大范围为V0 - Vmax,堆和数据可能不连续,栈遵循后进先出原则。操作系统需维护虚拟地址与物理位置的映射。还提到了PC、regs、MM等信息,以及操作系统维护的进程控制块。此外,强调了调度算法和数据结构的高效性。

 

 

 

 

 

 

 

 

 

 

 

V0-Vmax => max size of the process address space

 heap and data may not be contiguous

stack: last in first out

 

 

 

 any access of the process to x will access the correct physical location where x is stored.

 

 

 

not all processes requires the entire address space from V0 to Vmax

 

There may be portions of this address space that are not allocated. 

Also we may simply not have enough physical memory to store all this state.

 

the operating system must maintain information where these virtual addresses actually are in memory, on disk, since it maintains the mapping between the virtual addresses and the physical location of every part of the process address space.

 

https://blog.youkuaiyun.com/macrossdzh/article/details/5954763

 

 

 

 

 

 

 

PC: at any point of time, cpu needs to know where in the instruction sequence the process currently is 

regs: pc is also maintaining the pc by part of regs

MM: stack pointer/top of the stack of the process

 and other information

 

OS maintains the Process Control Block, including the information above

 

 
 

Process Control Block is a data structure that OS maintains for every one of the processes.

 

 

cpu has a dedicated register, used to track the current program counter for the currently executing process.

PC register will get automatically updated by the cpu on every new instruction 

 

 

 

 

 

  

 

 

 

 

 

 

 

 

root processes:

once the initial boot process is done, and the OS is loaded on the machine, it will create some number of initial processes.

 

and then when the user types in commands, like list or emacsm, then the new processes get spawned from that shell parent process.

 

 

 

 

 

Being efficient means that it's important to have both efficient designs as well as sufficient implementations of the various algorithms that are used, for instance in scheduling.

As well as efficient data structure that are used to representing things like the waitinig process, or any information that's relevant to making scheduling decisions.

 information => priority, history (how long ran in the past)

 

 

 

 

  

 

 

 

 

 

 

 

 

 

 

 

Because the OS is out of the way, it no longer supports fixed and well-defined APIs how this particular shared memory region is used.

For that reason, the usage sometimes becomes more error prone, or developers simply

 

 

 

 

 

 

转载于:https://www.cnblogs.com/ecoflex/p/10889085.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值