威廉·斯托尔斯《操作系统：精髓与设计原理》第六版英文答案详解

操作系统

4星 · 超过85%的资源需积分: 48 194 浏览量更新于2024-07-27 收藏 2.52MB PDF 举报

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

领优惠券(最高得80元）

《操作系统：精髓与设计原理》第六版英文答案详细解析本资源是一部针对操作系统核心概念和技术的权威教材——《Operating Systems: Internals and Design Principles》第六版的配套解答手册。作者William Stallings以其深厚的专业知识，提供了全面且深入的解答，覆盖了计算机系统概述、操作系统概述、进程描述与控制、线程、多处理器（SMP）和微内核、并发性与同步机制以及死锁和饥饿等问题。在第一章“Computer System Overview”中，读者将了解到计算机系统的构成，包括硬件、软件层次结构，以及它们之间的交互。这章旨在帮助理解操作系统如何在底层硬件上进行抽象和管理。第二章“Operating System Overview”深入剖析了操作系统的定义、类型和主要组件，如用户界面、内核、设备管理和资源管理器等，使学习者掌握操作系统的基本概念和功能。第三章“Process Description and Control”涵盖了进程的创建、调度、状态转换和同步等内容，对于理解进程如何执行任务、共享资源以及互相协作至关重要。第四章“Threads, SMP, and Microkernels”讨论了多线程编程的高效性，介绍了对称多处理器（SMP）架构的优势，以及微内核模型的原理和优势，这些知识对于现代并发编程和系统性能优化极其关键。第五章“Concurrency: Mutual Exclusion and Synchronization”深入讲解了并发环境中的同步和互斥问题，包括信号量、锁、条件变量等同步机制，这对于确保多任务间正确执行和数据一致性至关重要。第六章“Concurrency: Deadlock and Starvation”则着重于并发编程中的并发问题，如死锁的发生原因、预防和解决策略，以及饥饿现象的识别和处理，这些内容有助于避免潜在的系统故障和用户体验下降。总体来说，此资源不仅适合操作系统专业的学生深入学习，也是经验丰富的开发者查阅参考的宝贵资料，通过解决书中的问题和习题，读者可以加深对操作系统原理的理解，并提升实际编程和系统设计的能力。

资源详情

资源推荐

-16-

constraints related to the amount of memory devoted to the process state for

each process. At most N processes can be in the Running state, one for each

processor.

b. Zero is the minimum number of processes in each state. It is possible for all

processes to be in either the Running state (up to N processes) or the Ready

state, with no process blocked. It is possible for all processes to be blocked

waiting for I/O operations, with zero processes in the Ready and Running

states.

3.3 a. New → Ready or Ready/Suspend: covered in text

Ready → Running or Ready/Suspend: covered in text

Ready/Suspend → Ready: covered in text

Blocked → Ready or Blocked/Suspend: covered in text

Blocked/Suspend → Ready /Suspend or Blocked: covered in text

Running → Ready, Ready/Suspend, or Blocked: covered in text

Any State → Exit: covered in text

b. New → Blocked, Blocked/Suspend, or Running: A newly created process

remains in the new state until the processor is ready to take on an additional

process, at which time it goes to one of the Ready states.

Ready → Blocked or Blocked/Suspend: Typically, a process that is ready

cannot subsequently be blocked until it has run. Some systems may allow the

OS to block a process that is currently ready, perhaps to free up resources

committed to the ready process.

Ready/Suspend → Blocked or Blocked/Suspend: Same reasoning as

preceding entry.

Ready/Suspend → Running: The OS first brings the process into memory,

which puts it into the Ready state.

Blocked → Ready /Suspend: this transition would be done in 2 stages. A

blocked process cannot at the same time be made ready and suspended,

because these transitions are triggered by two different causes.

Blocked → Running: When a process is unblocked, it is put into the Ready

state. The dispatcher will only choose a process from the Ready state to run

Blocked/Suspend → Ready: same reasoning as Blocked → Ready /Suspend

Blocked/Suspend → Running: same reasoning as Blocked → Running

Running → Blocked/Suspend: this transition would be done in 2 stages

Exit → Any State: Can't turn back the clock

3.4 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

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.

-17-

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.5 Figure 9.3 in Chapter 9 shows the result for a single blocked queue. The figure

readily generalizes to multiple blocked queues.

3.6 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.7 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

3.8 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.

-18-

3.9 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.10 a. An 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.11 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.12 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.

-19-

CHAPTER 4 THREADS, SMP AND

MICROKERNELS

NSWERS TO

UESTIONS

4.1 This will differ from system to system, but in general, resources are owned by the

process and each thread has its own execution state. A few general comments about

each category in Table 3.5: Identification: the process must be identified but each

thread within the process must have its own ID. Processor State Information: these

are generally process-related. Process control information: scheduling and state

information would mostly be at the thread level; data structuring could appear at

both levels; interprocess communication and interthread communication may both

be supported; privileges may be at both levels; memory management would

generally be at the process level; and resource info would generally be at the

process level.

4.2 Less state information is involved.

4.3 Resource ownership and scheduling/execution.

4.4 Foreground/background work; asynchronous processing; speedup of execution by

parallel processing of data; modular program structure.

4.5 Address space, file resources, execution privileges are examples.

4.6 1. Thread switching does not require kernel mode privileges because all of the

thread management data structures are within the user address space of a single

process. Therefore, the process does not switch to the kernel mode to do thread

management. This saves the overhead of two mode switches (user to kernel; kernel

back to user). 2. Scheduling can be application specific. One application may benefit

most from a simple round-robin scheduling algorithm, while another might benefit

from a priority-based scheduling algorithm. The scheduling algorithm can be

tailored to the application without disturbing the underlying OS scheduler. 3. ULTs

can run on any operating system. No changes are required to the underlying kernel

to support ULTs. The threads library is a set of application-level utilities shared by

all applications.

4.7 1. In a typical operating system, many system calls are blocking. Thus, when a ULT

executes a system call, not only is that thread blocked, but also all of the threads

within the process are blocked. 2. In a pure ULT strategy, a multithreaded

application cannot take advantage of multiprocessing. A kernel assigns one process

-20-

to only one processor at a time. Therefore, only a single thread within a process can

execute at a time.

4.8 Jacketing converts a blocking system call into a nonblocking system call by using an

application-level I/O routine which checks the status of the I/O device.

4.9 SIMD: A single machine instruction controls the simultaneous execution of a

number of processing elements on a lockstep basis. Each processing element has an

associated data memory, so that each instruction is executed on a different set of

data by the different processors.. MIMD: A set of processors simultaneously

execute different instruction sequences on different data sets. Master/slave: The

operating system kernel always runs on a particular processor. The other

processors may only execute user programs and perhaps operating system utilities.

SMP: the kernel can execute on any processor, and typically each processor does

self-scheduling from the pool of available processes or threads. Cluster: Each

processor has a dedicated memory, and is a self-contained computer.

4.10 Simultaneous concurrent processes or threads; scheduling; synchronization;

memory management; reliability and fault tolerance.

4.11 Device drivers, file systems, virtual memory manager, windowing system, and

security services.

4.12 Uniform interfaces: Processes need not distinguish between kernel-level and user-

level services because all such services are provided by means of message passing.

Extensibility: facilitates the addition of new services as well as the provision of

multiple services in the same functional area. Flexibility: not only can new

features be added to the operating system, but existing features can be subtracted

to produce a smaller, more efficient implementation. Portability: all or at least

much of the processor-specific code is in the microkernel; thus, changes needed to

port the system to a new processor are fewer and tend to be arranged in logical

groupings. Reliability: A small microkernel can be rigorously tested. Its use of a

small number of application programming interfaces (APIs) improves the chance

of producing quality code for the operating-system services outside the kernel.

Distributed system support: the message orientation of microkernal

communication lends itself to extension to distributed systems. Support for

object-oriented operating system (OOOS): An object-oriented approach can lend

discipline to the design of the microkernel and to the development of modular

extensions to the operating system.

4.13 It takes longer to build and send a message via the microkernel, and accept and

decode the reply, than to make a single service call.

4.14 These functions fall into the general categories of low-level memory management,

inter-process communication (IPC), and I/O and interrupt management.

4.15 Messages.

NSWERS TO

ROBLEMS

剩余111页未读，继续阅读

yishuyan

粉丝: 4
资源: 5

威廉·斯托尔斯《操作系统：精髓与设计原理》第六版英文答案详解

操作系统精髓与设计原理 第六版 习题答案

操作系统精髓与设计原理_第六版_教材与习题解答全

操作系统:精髓与设计原理(英文第七版).pdf

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

操作系统精髓与设计原理第九版csdn

操作系统精髓与设计原理第8版 pdf

操作系统精髓与设计原理

操作系统――精髓与设计原理(第九版 site:csdn.net

操作系统精髓与设计原理答案

操作系统原理期末复习资料

银行家算法Java参考文献

我想做一个简单的功能完备操作系统，来加深对操作系统的理解，你能给我提供哪些帮助

大学慕课c语言程序设计精髓答案

linux内核精髓 pdf

linux系统原理构架

支付宝移动设计精髓 pdf

c语言程序设计精髓mooc第三周

unix编程艺术 英文版

scrum精髓:敏捷转型指南 pdf

b端产品设计精髓电子书下载

最新资源

操作系统精髓与设计原理第六版习题答案

unix编程艺术英文版