Chapter 10 - OS2T

Question 1

Static table-driven scheduling is applicable to tasks that are periodic.

Answer

true

Question 2

In the real-time-priority class, all threads have a fixed priority that never changes and all of the active threads at a given priority level are in a round-robin queue.

Answer

true

Question 3

User control is generally much broader in an ordinary operating system than in a real-time operating system.

Answer

true

Question 4

The operating system, and in particular the scheduler, is perhaps the most important component of a real-time system.

Answer

true

Question 5

One of the more promising methods of resolving multitask scheduling conflicts for periodic tasks is rate monotonic scheduling.

Answer

true

Question 6

A loosely coupled or distributed multiprocessor consists of a collection of relatively autonomous systems, with each processor having its own main memory and I/O channels.

Answer

true

Question 7

Real-time tasks are not handled any differently than non-real-time tasks in the priority queues.

Answer

true

Question 8

With independent parallelism there is an explicit synchronization among processes.

Answer

true

Question 9

One useful measure of the ability of an operating system to function deterministically is the maximum delay from the arrival of a high-priority device interrupt to when servicing begins.

Answer

true

Question 10

An application can be implemented as a set of threads, which cooperate and execute concurrently in the same address space.

Answer

true

Question 11

In most traditional multiprocessor systems processes are dedicated to processors.

Answer

true

Question 12

Because of the potential disadvantages, load sharing is not one of the commonly used schemes in current multiprocessors.

Answer

true

Question 13

An example of __________ is an I/O processor.

Accepted Answer

Functionally specialized processors

Answer

Cluster multiprocessing

Answer

Loosely coupled or distributed multiprocesor

Answer

Tightly coupled multiprocessor

Question 14

[blank_start]_________[blank_end] perform static analysis of feasible schedules of dispatching with the result of the analysis being a schedule that determines, at run time, when a task must begin execution.

Accepted Answer

Static table-driven approaches

Question 15

Typically, there will need to be a rather high degree of coordination and interaction among the threads of an application, leading to a [blank_start]_______[blank_end] level of asynchronization.

Accepted Answer

medium grain

Question 16

The [blank_start]_________[blank_end] approach is a set of related threads scheduled to run on a set of processes at the same time, on a one-to-one basis.

Accepted Answer

gang scheduling

Question 17

A [blank_start]_________[blank_end] has an associated deadline that is desirable but not mandatory.

Accepted Answer

soft real-time task

Question 18

In the [blank_start]________[blank_end] approach, a priority is associated with each resource.

Accepted Answer

priority ceiling

Question 19

The multiprocessor system which consists of a set or processors that share a common main memory and are under the integrated control of an operating system is a [blank_start]________[blank_end].

Accepted Answer

tightly coupled multiprocessor

Question 20

With course and [blank_start]_____[blank_end] grained parallelism, there is synchronization among processes, but at a very gross level.

Accepted Answer

very course

Question 21

A [blank_start]_________[blank_end] is one that must meet its deadline, otherwise it will cause unacceptable damage or a fatal error to the system.

Accepted Answer

hard real-time task

Question 22

With the [blank_start]_______[blank_end] approach the number of threads in a process can be altered during the course of execution.

Accepted Answer

dynamic scheduling

Question 23

[blank_start]_________[blank_end] is the time required to execute the task to completion.

Accepted Answer

Processing time

Question 24

The basic idea of [blank_start]_________[blank_end] is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.

Accepted Answer

priority inheritance

Question 25

_________ is the lowest-priority process, intended for user applications other than real-time applications.

Accepted Answer

time-shared

Answer

real-time

Answer

variable priority

Answer

kernel

Chapter 10 - OS2T

Fragen in diesem Quiz (25)

Informationen

Feedback

Wie gefällt dir das neue Design?