The multiprocessor system which consists of a set of processors that share a common main memory and are under the integrated control of an operating system is a _________ .

With coarse and __________ grained parallelism, there is synchronization among processes, but at a very gross level.

An example of __________ is an I/O processor.

A __________ is one that must meet its deadline, otherwise it will cause unacceptable damage or a fatal error to the system.

Typically, there will need to be a rather high degree of coordination and interaction among the threads of an application, leading to a __________ level of synchronization.

The __________ approach is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.

A _________ has an associated deadline that is desirable but not mandatory.

With the __________ approach the number of threads in a process can be altered during the course of execution.

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

__________ is the time required to execute the task to completion.

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

In the __________ approach, a priority is associated with each resource.

Processes at _________ priority levels are guaranteed to be selected to run before any time-sharing process but must defer to real-time processes.

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

The __________ class is intended for applications that will only consume processor time when no other threads are ready to execute.

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.

With independent parallelism there is an explicit synchronization among processes.

A typical use of independent parallelism is in a time-sharing system.

A disadvantage of static assignment is that one processor can be idle, with an empty queue, while another processor has a backlog.

In most traditional multiprocessor systems processes are dedicated to processors.

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

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

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

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.

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

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

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

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

Linux provided a real-time scheduling capability coupled with a scheduler for non-real-time processes that made use of the traditional UNIX scheduling algorithm.

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

Examples of human readable external I/O devices are printers, terminals, and keyboards.

The use to which a device is put does not have an influence on the software and polices in the operating system and supporting utilities.

Direct memory access is the dominant form of transfer that must be supported by the operating system.

The hierarchical philosophy is that the functions of the operating system should be separated according to their complexity, their characteristic time scale, and their level of abstraction.

The actual queuing and scheduling of I/O operations occurs at the logical I/O module.

Access rights are managed at the physical organization layer.

Double buffering is when a process transfers data to (or from) one buffer while the operating system empties (or fills) the other.

RAID 0 provides real-time backups of all data so that in the event of a disk failure, all of the critical data is still immediately available.

The SCAN policy favors jobs whose requests are for tracks nearest to both innermost and outermost tracks, and favors the latest arriving jobs.

RAID is a set of physical disk drives viewed by the operating system as a single logical drive.

Windows has no way to support the encryption of entire volumes.

Cache memory reduces average memory access time by exploiting the principle of locality.

A key aspect of I/O is the use of buffers that are controlled by I/O utilities rather than by application processes.

Two of the most widely used approaches to improve disk I/O performance are disk scheduling and disk cache.

In the C-SCAN disk scheduling algorithm, the disk arm is required to move in one direction only until it reaches the last track or there are no more requests to service in that direction, then it reverses direction and the scan proceeds in the opposite direction in the same fashion

The __________ category of external devices are suitable for communicating with the computer user.

The __________ unit is capable of mimicking the processor and of taking over control of the system bus just like a processor.

__________ external devices are suitable for communicating with electronic equipment.

The requested operations and data are converted into appropriate sequences of I/O instructions, channel commands, and controller orders at the __________ layer.

_________ external devices are suitable for communicating with modems.

__________ is a technique that smoothes out peaks in I/O demand.

The advantage of _________ is that it provides extremely high data availability.

RAID 5 is organized in a similar fashion to _________ , but is different in the fact that RAID 5 distributes the parity strips across all disks.

The _________ technique is used on a Windows server to optimize the use of threads.

On a moveable-head system, the time it takes to position the head at the track is known as ________ .

RAID level __________ is not a true member of the RAID family because it does not include redundancy to improve performance or provide data protection.

The __________ technique allows multiple simultaneous I/O requests against a single device or file.

__________ are an efficient way of making consistent snapshots of volumes so that they can be backed up.

The disk scheduling algorithm that implements two sub-queues in a measure to avoid the problem of "arm stickiness" is the __________ .

The simplest type of support that the operating system can provide is _________ .

In a multiprogramming system multiple processes exist concurrently in main memory.

The key to multiprogramming is scheduling.

The medium-term scheduler is invoked whenever an event occurs that may lead to the blocking of the current process or that may provide an opportunity to preempt a currently running process in favor of another.

Scheduling affects the performance of the system because it determines which processes will wait and which will progress.

The main objective of long-term scheduling is to allocate processor time in such a way as to optimize one or more aspects of system behavior.

In most interactive operating systems adequate response time is the critical requirement.

One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.

FCFS performs much better for short processes than long ones.

Round robin is particularly effective in a general purpose time sharing system or transaction processing system.

The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, and more to those who have had less than their fair share.

The traditional UNIX scheduler employs multilevel feedback using round robin within each of the priority queues.

First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.

In the Highest Response Ration Next (HRRN) scheduling policy, longer jobs are favored because they yield a larger ratio from the smaller denominator in the equation.

A disadvantage of simulation is that results for a given run only apply to that particular collection of processes under that particular set of assumptions.

In fair share scheduling each user is assigned a weighting of some sort that defines that user's share of system resources as a fraction of the total usage of those resources.

The decision as to which available process will be executed by the processor:

The _________ determines which process, among ready processes, is selected next for execution.

Which of the following scheduling policies allow the O/S to interrupt the currently running process and move it to the Ready state?

The __________ specifies the instants in time at which the selection function is exercised

The traditional UNIX scheduler divides processes into fixed bands of priority levels, with the highest priority band being the _________ .

This is a decision whether to add a new process to the set of processes that are currently active:

A risk with _________ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.

The decision as to which process' pending I/O request shall be handled by an available I/O device:

This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution:

In the case of the __________ policy, the scheduler always chooses the process that has the shortest expected remaining processing time.

Response time in an interactive system is an example of:

__________ considers the execution history of a related group of processes along with the individual execution history of each process in making scheduling decisions.

The operating system must make _________ types of scheduling decisions with respect to the execution of processes.

Typically, the swapping-in function for processes is based on the need to manage _______ .

The strategy that schedules processes based on their group affiliation is generally referred to as _________ .