威廉·斯托尔林斯《操作系统》第五版习题答案全集

操作系统

需积分: 33 22 浏览量更新于2024-07-26 收藏 1.29MB PDF 举报

身份认证购VIP最低享 7 折!

30元优惠券

操作系统是计算机系统的核心组成部分，它负责管理硬件资源、提供用户接口以及协调各个软件组件之间的交互。本资源是《操作系统：内部结构与设计原则》第五版的解答手册，作者是William Stallings。该书在版权页明确指出，所有内容受版权保护，未经作者许可，禁止任何形式的复制或互联网发布。第一章"计算机系统概述"介绍了计算机架构的基本概念，包括硬件组成（如CPU、内存、输入输出设备）和它们如何协同工作来执行指令。这一章帮助学生理解计算机系统的层次结构及其运作原理。第二章"操作系统概述"详细解析了操作系统的定义、类型（如批处理、实时、分时和网络操作系统），以及其在系统中的角色。它还讨论了操作系统的主要功能，如进程管理、内存管理和文件系统等。第三章"进程描述和控制"深入探讨了进程的概念，包括进程的生命周期、状态转换以及进程控制原语。学生可以借此了解操作系统如何调度和管理不同的进程，确保资源的有效利用。第四章涉及"线程、SMP（对称多处理器）和微内核"，讲述了并发编程的核心要素，解释了如何通过创建轻量级线程来提高系统性能，以及SMP架构下多个处理器间的协作。微内核模型的讨论则强调了模块化和安全性的重要性。第五章和第六章关注"并发：互斥与同步"和"并发：死锁与饥饿"。互斥是指对共享资源的独占访问，而同步则是确保多个进程正确协作的关键。死锁是指两个或更多进程因等待对方释放资源而陷入僵局，饥饿则是指某些进程长期得不到执行的情况。第七章"内存管理"涵盖了内存分配、内存保护、虚拟内存的概念，以及页面替换算法等技术。这是操作系统确保有效内存使用和避免数据丢失的关键部分。第八章"虚拟内存"进一步阐述了如何通过虚拟地址空间抽象出物理内存，使得程序可以超过实际内存大小运行。这里会讲解虚拟地址到物理地址的映射机制以及页面交换和缓存策略。第九章"Uniprocessor（单处理器）系统"可能是指单一处理器环境下的操作系统设计和优化，可能包含单线程操作系统的特性和限制，以及如何在有限资源下最大化效率。通过这本解答手册，学习者能够解决《操作系统第五版》中的复习问题和作业题，巩固理论知识，并理解操作系统在现代计算机系统中的关键作用。对于软件工程专业的学生来说，这是一份宝贵的参考资料，可以帮助他们深入理解操作系统的设计原则和技术细节。

资源详情

资源推荐

-14-

NSWERS TO

UESTIONS

3.1 An instruction trace for a program is the sequence of instructions that execute for

that process.

3.2 New batch job; interactive logon; created by OS to provide a service; spawned by

existing process. See Table 3.1 for details.

3.3 Running: The process that is currently being executed. Ready: A process that is

prepared to execute when given the opportunity. Blocked: A process that cannot

execute until some event occurs, such as the completion of an I/O operation. New:

A process that has just been created but has not yet been admitted to the pool of

executable processes by the operating system. Exit: A process that has been released

from the pool of executable processes by the operating system, either because it

halted or because it aborted for some reason.

3.4 Process preemption occurs when an executing process is interrupted by the

processor so that another process can be executed.

3.5 Swapping involves moving part or all of a process from main memory to disk.

When none of the processes in main memory is in the Ready state, the operating

system swaps one of the blocked processes out onto disk into a suspend queue, so

that another process may be brought into main memory to execute.

3.6 There are two independent concepts: whether a process is waiting on an event

(blocked or not), and whether a process has been swapped out of main memory

(suspended or not). To accommodate this 2 × 2 combination, we need two Ready

states and two Blocked states.

3.7 1. The process is not immediately available for execution. 2. The process may or

may not be waiting on an event. If it is, this blocked condition is independent of the

suspend condition, and occurrence of the blocking event does not enable the

process to be executed. 3. The process was placed in a suspended state by an agent;

either itself, a parent process, or the operating system, for the purpose of

preventing its execution. 4. The process may not be removed from this state until

the agent explicitly orders the removal.

3.8 The OS maintains tables for entities related to memory, I/O, files, and processes.

See Table 3.10 for details.

3.9 Process identification, processor state information, and process control information.

3.10 The user mode has restrictions on the instructions that can be executed and the

memory areas that can be accessed. This is to protect the operating system from

CHAPTER 3

PROCESS DESCRIPTION AND CONTROL

-15-

damage or alteration. In kernel mode, the operating system does not have these

restrictions, so that it can perform its tasks.

3.11 1. Assign a unique process identifier to the new process. 2. Allocate space for the

process. 3. Initialize the process control block. 4. Set the appropriate linkages. 5.

Create or expand other data structures.

3.12 An interrupt is due to some sort of event that is external to and independent of the

currently running process, such as the completion of an I/O operation. A trap

relates to an error or exception condition generated within the currently running

process, such as an illegal file access attempt.

3.13 Clock interrupt, I/O interrupt, memory fault.

3.14 A mode switch may occur without changing the state of the process that is

currently in the Running state. A process switch involves taking the currently

executing process out of the Running state in favor of another process. The process

switch involves saving more state information.

NSWERS TO

ROBLEMS

3.1 •Creation and deletion of both user and system processes. The processes in the

system can execute concurrently for information sharing, computation speedup,

modularity, and convenience. Concurrent execution requires a mechanism for

process creation and deletion. The required resources are given to the process

when it is created, or allocated to it while it is running. When the process

terminates, the OS needs to reclaim any reusable resources.

•Suspension and resumption of processes. In process scheduling, the OS needs to

change the process's state to waiting or ready state when it is waiting for some

resources. When the required resources are available, OS needs to change its

state to running state to resume its execution.

•Provision of mechanism for process synchronization. Cooperating processes

may share data. Concurrent access to shared data may result in data

inconsistency. OS has to provide mechanisms for processes synchronization to

ensure the orderly execution of cooperating processes, so that data consistency is

maintained.

•Provision of mechanism for process communication. The processes executing

under the OS may be either independent processes or cooperating processes.

Cooperating processes must have the means to communicate with each other.

•Provision of mechanisms for deadlock handling. In a multiprogramming

environment, several processes may compete for a finite number of resources. If

a deadlock occurs, all waiting processes will never change their waiting state to

running state again, resources are wasted and jobs will never be completed.

3.2 The following example is used in [PINK89] to clarify their definition of block and

suspend:

Suppose a process has been executing for a while and needs an additional

magnetic tape drive so that it can write out a temporary file. Before it can

initiate a write to tape, it must be given permission to use one of the drives.

When it makes its request, a tape drive may not be available, and if that is the

-16-

case, the process will be placed in the blocked state. At some point, we assume

the system will allocate the tape drive to the process; at that time the process

will be moved back to the active state. When the process is placed into the

execute state again it will request a write operation to its newly acquired tape

drive. At this point, the process will be move to the suspend state, where it

waits for the completion of the current write on the tape drive that it now

owns.

The distinction made between two different reasons for waiting for a device could

be useful to the operating system in organizing its work. However, it is no

substitute for a knowledge of which processes are swapped out and which

processes are swapped in. This latter distinction is a necessity and must be reflected

in some fashion in the process state.

3.3 Figure 9.3 shows the result for a single blocked queue. The figure readily

generalizes to multiple blocked queues.

3.4 Penalize the Ready, suspend processes by some fixed amount, such as one or two

priority levels, so that a Ready, suspend process is chosen next only if it has a

higher priority than the highest-priority Ready process by several levels of priority.

3.5 a. A separate queue is associated with each wait state. The differentiation of

waiting processes into queues reduces the work needed to locate a waiting

process when an event occurs that affects it. For example, when a page fault

completes, the scheduler know that the waiting process can be found on the

Page Fault Wait queue.

b. In each case, it would be less efficient to allow the process to be swapped out

while in this state. For example, on a page fault wait, it makes no sense to swap

out a process when we are waiting to bring in another page so that it can

execute.

c. The state transition diagram can be derived from the following state transition

table:

Next State

Current State

Currently

Executing

Computable

(resident)

Computable

(outswapped)

Variety of wait

states (resident)

Variety of wait

states

(outswapped)

Currently

Executing

Rescheduled

Wait

Computable

(resident)

Scheduled

Outswap

Computable

(outswapped)

Inswap

Variety of wait

states (resident)

Event satisfied

Outswap

Variety of wait

states

(outswapped)

Event satisfied

-17-

3.6 a. The advantage of four modes is that there is more flexibility to control access to

memory, allowing finer tuning of memory protection. The disadvantage is

complexity and processing overhead. For example, procedures running at each

of the access modes require separate stacks with appropriate accessibility.

b. In principle, the more modes, the more flexibility, but it seems difficult to

justify going beyond four.

3.7 a. With j < i, a process running in D

is prevented from accessing objects in D

Thus, if D

contains information that is more privileged or is to be kept more

secure than information in D

, this restriction is appropriate. However, this

security policy can be circumvented in the following way. A process running in

could read data in D

and then copy that data into D

. Subsequently, a

process running in D

could access the information.

b. An approach to dealing with this problem, known as a trusted system, is

discussed in Chapter 16.

3.8 a. A application may be processing data received from another process and

storing the results on disk. If there is data waiting to be taken from the other

process, the application may proceed to get that data and process it. If a

previous disk write has completed and there is processed data to write out, the

application may proceed to write to disk. There may be a point where the

process is waiting both for additional data from the input process and for disk

availability.

b. There are several ways that could be handled. A special type of either/or queue

could be used. Or the process could be put in two separate queues. In either

case, the operating system would have to handle the details of alerting the

process to the occurrence of both events, one after the other.

3.9 This technique is based on the assumption that an interrupted process A will

continue to run after the response to an interrupt. But, in general, an interrupt may

cause the basic monitor to preempt a process A in favor of another process B. It is

now necessary to copy the execution state of process A from the location associated

with the interrupt to the process description associated with A. The machine might

as well have stored them there in the first place. Source: [BRIN73].

3.10 Because there are circumstances under which a process may not be preempted (i.e.,

it is executing in kernel mode), it is impossible for the operating system to respond

rapidly to real-time requirements.

剩余83页未读，继续阅读

chen024719

粉丝: 0
资源: 2

威廉·斯托尔林斯《操作系统》第五版习题答案全集

山东大学操作系统答案.docx

计算机操作系统答案汤小丹

操作系统答案 刘振鹏

ubuntu linux操作系统答案

linux网络操作系统答案

头歌linux操作系统答案

头歌linux操作系统答案vi/vim基本用法

北邮操作系统习题答案 csdn

计算机操作系统课后答案第三版庞丽萍csdn

操作系统概念第七版课后答案csdn

现代操作系统第四版 答案 pdf 脚本之家

操作系统概念答案csdn

五道关于Esxi的选择题

操作系统第五版课后答案罗宇csdn

计算机操作系统慕课版答案

操作系统教程第五版费祥林课后答案csdn

操作系统精髓与设计原理第九版答案key terms

计算机操作系统复习题及答案

计算机操作系统第四版 汤xiao丹课后答案 免费

操作系统第四章课后答案csdn

最新资源

操作系统答案刘振鹏

现代操作系统第四版答案 pdf 脚本之家

计算机操作系统第四版汤xiao丹课后答案免费