Stallings操作系统答案解析：从基础到并发控制

下载需积分: 50 | PDF格式 | 2.52MB | 更新于2024-07-26 | 24 浏览量 | 举报

本资源是一份针对《操作系统：内部与设计原理》第六版的课后参考答案，由著名作者威廉·斯托林斯编写，版权归属2008年威廉·斯托林斯。该手册提供了对《计算机系统概述》、《操作系统概述》、《进程描述与控制》、《线程、SMP与微内核》、《并发：互斥与同步》和《并发：死锁与饥饿》等章节的详细解答，旨在帮助学生理解和解决作业中的问题。值得注意的是，这些答案仅限于个人学习参考，未经作者威廉·斯托林斯书面许可，不得任何形式复制或在互联网上公开发布，以保护知识产权。在第一章中，"计算机系统概述"涵盖了基础概念，如计算机硬件组成、软件层次结构以及它们之间的交互，有助于理解操作系统如何在底层硬件之上提供服务。第二章"操作系统概述"深入探讨了操作系统的作用，包括它的主要组件（如处理器管理、内存管理、设备管理和文件系统）以及它在系统中的地位，对于初学者来说是理解操作系统核心原理的重要起点。第三章"进程描述与控制"涉及进程的基本概念，如进程创建、调度、状态转换和同步机制，这对于理解并发计算的基石——进程及其管理至关重要。第四章"线程、SMP和微内核"扩展了并发主题，介绍了多线程技术，如何利用SMP（对称多处理器）架构提高性能，以及微内核架构的设计思想，这些内容对于高级并发和系统效率优化具有实际指导意义。第五章"并发：互斥与同步"讨论了并发编程中的关键问题，包括互斥（确保同一时间只有一个进程访问共享资源）、信号量、条件变量等同步机制，这些都是避免数据竞争和死锁的重要手段。第六章"并发：死锁与饥饿"深入剖析了并发环境中的复杂性，解释了死锁的定义、检测与避免策略，以及饥饿现象的识别和缓解方法，帮助读者掌握并发控制的高级技巧。总体而言，这份参考答案是学习操作系统理论和实践的重要辅助资料，对于解决课程作业、深化理解操作系统原理和解决实际问题具有极大价值。但请记住，尽管可以作为学习工具，但在学术诚信的前提下谨慎使用，并尊重作者的知识产权。

-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页未读，继续阅读

快乐的企鹅

粉丝: 2
资源: 10

Stallings操作系统答案解析：从基础到并发控制

免费《操作系统教程》谢旭升版答案及习题参考答案

网络操作系统试卷三及参考答案：操作系统试卷选择题总结

操作系统复习重点与答案解析

操作系统参考答案.pdf

操作系统概念参考答案

操作系统教程 参考答案

操作系统教程参考答案

操作系统原理参考答案

操作系统 答案 操作系统 答案 操作系统 答案

操作系统作业及参考答案

最新资源

操作系统教程参考答案

操作系统答案操作系统答案操作系统答案