An SMP can be defined as a stand-alone computer system with two or more similar processors of comparable capability.
Over the years memory access speed has consistently increased more rapidly than processor speed.
The ___ chooses which block to replace when a new block is to be loaded into the cache and the cache already has all the slots filled with other blocks.
memory controller
mapping function
write policy
replacement algorithm
When an external device becomes ready to be serviced by the processor, the device sends a(n) ___ signal to the processor.
access
halt
handler
interrupt
The ____ holds the address of the next instruction.
Accumulator (AC)
Instruction Register (IR)
Instruction Counter (IC)
Program Counter (PC)
Small, fast memory located between the processor and main memory is called ____.
Block memory
Cache memory
Direct memory
WORM memory
One mechanism Intel uses to make its caches more effective is _______.
mapping
handling
interconnecting
prefetching
In a uniprocessor system, multiprogramming increases processor efficiency by _____.
taking advantage of time wasted by long wait interrupt handling
disabling all interrupts execpt those of highest priority
eliminating all idle processor cycles
increasing processor speed
The processor controls the operation of the computer and performs its data processing functions.
Instruction processing consists of two steps:
fetch and execute
instruction and execute
instruction and halt
fetch and instruction
The ____ is the external data by which the OS is able to supervise and control the process.
execution context
associated data
executable program
nucleus
The processor itself is not a resource so the OS is not involved in determining how much of the processor time is devoted to the execution of a user.
Multiprogramming operating systems are fairly sophisticated compared to single-program or _____ systems.
time-sharing
uniprogramming
multitasking
memory management
Hardware features desirable in a batch-processing OS include memory protection, timer, privileged instructions and ______.
clock cycles
interrupts
kernels
• A common strategy to give each process in the queue some time in turn is referred to as a _____ technique.
multi-threading
serial processing
time slicing
round-robin
The technique where a system clock generates interrupts, and at each clock interrupt the OS regains control and assigns the processor to another user is _____.
clock cycle
multithreading
______ is where the OS must prevent independent processes from interfering with each other’s memory, both data and instructions.
Protection and access control
Support of modular programming
Process isolation
Automatic allocation and management
The phrase "control is passed to a job" means that the processor is now fetching and executing instructions from the monitor program.
The key to success of Linux has been its availability for free under the auspice of the _______.
World Wide Web Consortium
Free Software Foundation
Berkeley Software Distribution
GNU Public License
Both batch processing and time-sharing use multiprogramming.
If a system does not employ virtual memory each process to be executed must be fully loaded into main memory.
It is the principal responsibility of the ____ to control the execution of processes.
OS
process control block
memory
dispatcher
The ____ is the less-privileged mode.
user mode
kernel mode
system mode
control mode
The portion of the operating system that selects the next process to run is called the ____.
trace
PSW
The collection of program, data, stack, and attributes is referred to as the ____.
process structure
process location
process image
A process in the state is in main memory and available for execution.
The process control block is the least important data structure in an OS.
When a process is in the ____ state it is in secondary memory but is available for execution as soon as it is loaded into main memory.
Blocked
Blocked/Suspend
Ready
Ready/Suspend
A total of ____ process states are recognized by the UNIX SVR4 operating system.
3
9
21
15
The principal function of the OS is to create, manage, and terminate processes.
In a multithreaded environment, a _____ is defined as the unit of resource allocation and a unit of protection.
strand
process
string
_____ is a good example of an OS using a combined ULT/KLT approach.
TRIX
Windows
LINUX
Solaris
A ____ is a user-created unit of execution within a process.
Kernel
KLT
lightweight process
ULT
The _____ are the fundamental entities that can be scheduled and dispatched to run on one of the system processors.
Processes
Kernel threads
LWPs
ULTs
A ____ is a dispatchable unit of work that executes sequentially and is interruptible so that the processor can turn to another thread.
port
token
thread
A Windows process must contain at least ___ thread(s) to execute.
four
three
two
one
It takes less time to terminate a process than a thread.
The blocked state in which the process is waiting for an event, such as the end of an I/O operation, the availability of a resource, or a signal from another process is the ____ state.
Times and timers
Uninterruptible
Stopped
Interruptible
The ____ state is when the thread has terminated.
ZOMBIE
FREE
STOP
SLEEP
Any alteration of a resource by one thread affects the environment of the other threads in the same process.
As an extension of the principles of modular design and structured programming, some applications can be effectively programmed as a set of concurrent processes.
A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, is _____.
mutual exclusion
deadlock
starvation
livelock
A semaphore that does not specify the order in which processes are removed from the queue is a _____ semaphore.
weak
general
strong
binary
A ____ is a data type that is used to block a process or thread until a particular condition is true.
general semaphore
condition variable
mutex
The _____ is a programming language construct that provides equivalent functionality to that of semaphores and is easier to control.
atomic operation
co-routine
critical section
monitor
The requirement that when one process is in a critical section that accesses shared resources, no other process may be in a critical section that accesses any of those shared resources is ____.
linelock
The sharing of main memory among processes is useful to permit efficient and close interaction among processes because such sharing does not lead to any problems.
The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.
The management of multiple processes within a uniprocessor system is ___.
multiprogramming
structured applications
disturbed processing
multi-management processing
The term ____ refers to a technique in which a process can do nothing until it gets permission to enter its critical section but continues to execute an instruction or set of instructions that tests the appropriate variable to gain entrance.
spin waiting
critical resource
message passing
The most common technique used for protecting a critical section in Linux is the _____.
singal
atomic bitmap operation
atomic integer operation
spinlock
Interrupts, signals, messages, and information in I/O buffers are all example of reusable resources.
Requested resources are granted to processes whenever possible with _____.
deadlock detection
preemption
deadlock avoidance
The ____ allows multiple threads to have simultaneous read-only access to an object protected by the lock.
barrier
readers/writer lock
Examples of ___ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.
regional resources
joint resources
reusable resources
consumable resources
A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of ____.
no preemption
circular wait
hold and wait
The strategy of deadlock ____ is to design a system in such a way that the possibility of deadlock is excluded.
prevention
detection
diversion
avoidance
One of the most significant contributions of UNIX to the development of operating systems is the ____.
semaphore
pipe
message
shared memory
Deadlock is permanent because none of the events are ever triggered.
The fastest form of inter-process communication provided in UNIX is ____.
In a multiprogramming system the available main memory is not generally shared among a number of processes.
A ____ is a particular example of logical addresses in which the address is expressed as a location relative to some known point, usually a value in a processor register.
logical address
relative address
absolute address
physical address
The page table for each process maintains ____.
the physical memory location of the process
the frame location for each page of the process
the page location for each frame of the process
the logical memory location of the process
In a system employing a segmentation scheme for memory management a process is divided into ___
one segment per thread
a number of threads
a number of segments which need not be of equal size
a number of segments which must be of equal size
Available chunks of memory are known as ____.
frames
segments
addresses
pages
In a multiprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.
In a system employing a segmentation scheme for memory management wasted space is due to _____.
frames of different sizes
external fragmentation
internal fragmentation
segments of different sizes
In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and choose the next available block that is large enough to satisfy the request is called _____>
next-fit
first-fit
last-fit
best-fit
In a system employing a paging scheme for memory management wasted space is due to _____.
pages of different specified sizes
frames of different specified sizes
One technique for overcoming external fragmentation is ____.
loading
compaction
relocation
partitioning
Segments may be of unequal, indeed dynamic, size.
A ____ is issued if a desired page is not in main memory.
paging error
paging replacement policy
page fault
page placement policy
The ____ determines when a page should be brought into main memory.
fetch policy
working set
resident set management
The ____ policy results in the fewest number of page faults.
optimal
FIFO
clock
LRU
The ____ algorithm requires a use bit to be associated with each page in memory.
page placement
VSWS
page fault frequency
The ____ structure indexes page table entries by frame number rather than by virtual page number.
hash table
inverted page table
page table
segment table
The principle of locality states that program and data references within a process do not tend to cluster.
______ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.
Hashing
Paging
Segemention
Thrashing
____ is a range memory addresses available to a process.
Address space
Real address
Virtual address
Virtual address space
____ allows the programmer to view memory as consisting of multiple address spaces.
Locality
Segmentation
Resident set managment
Which of the following scheduling policies allow the OS to interrupt the currently running process and move it to the Ready state?
FCFS
non-preemptive
preemptive
The strategy that schedules processes based on their group affiliation is generally referred to as ______.
shortest process next
fair share scheduling
queuing analysis
simulation modeling
The ____ specifies the instants in time at which the selection function is exercised.
decision mode
medium-term scheduling
ready state
TAT
This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution.
short-term scheduling
long-term scheduling
I/O scheduling
Typically, the swapping-in function for processes is based on the need to manage ____.
the degree of multiprogramming
I/O requirements
process priorities
virtual memory
Response time in an interactive system is an example of:
user-oriented criteria for long-term scheduling policies
system-oriented criteria for short-term scheduling policies
system-oriented criteria for long-term scheduling policies
user-oriented criteria for short-term scheduling policies
A risk with ____ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.
SRT
SPN
First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.
The traditional UNIX scheduler divides processes into fixed bands of priority levels, with the highest priority band being the ____.
user process band
swapper band
file manipulation band
utilization band
One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.
The multiprocessor system which consists of a set or processors that share a common main memory and are under the integrated control of an operation system is a _____.
tightly coupled multiprocessor
cluster
functionally specialized processor
loosely coupled or distributed multiprocessor
_____ 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.
Static priority-driven preemptive approaches
Static table-drive approaches
Dynamic planning-based approaches
Dynamic best effort approaches
The basic idea of _____ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.
priority ceiling
priority inversion
unbounded priority inversion
priority inheritance
User control is a generally much broader in an ordinary operating system than in a real-time operating system.
With coarse and ____ grained parallelism, there is a synchronization among processes, but at a very gross level.
medium
fine
independent
very course
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.
dynamic scheduling
load sharing
gang scheduling
dedicated processor assignment
The ____ class is intended for applications that will only consume processor time when no other threads are ready to execute.
idle user
time sharing
bottom-half kernel
real-time
______ is the time required to execute the task to completion.
Processing time
Priority
Resource requirements
Ready time
Processes at ____ priority levels are guaranteed to be selected to run before any time-sharing process but must defer to real-time processes.
kernel
load-sharing
With independent parallelism there is an explicit synchronization among processes.
The advantage of ____ is that it provides extremely high data availability.
RAID 2
RAID 4
RAID 0
RAID 6
On a movable-head system, the time it takes to position the head at the track is known as
access time
seek time
transfer time
rotational delay
The disk scheduling algorithm that implements two sub-queues in a measure to avoid the problem of "arm stickiness" is the ______.
C-SCAN policy
FSCAN policy
DMA
N-step-SCAN policy
_____ external devices are suitable for communicating with modems.
Human-readable
Application
Machine-readable
Communication
The simplest type of support that the operating system can provide is _____.
overflow buffering
dual buffering
single buffering
circular buffering
Cache memory reduces average memory access time by exploiting the principle of locality.
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.
_____ is a technique that smooths out peaks in I/O demand.
Buffering
Blocking
Smoothing
Tracking
The _____ unit is capable of mimicking the processor and of taking over control of the system bus, just like a processor.
interrupt-driven I/O
I/O channel
direct memory access
programmed I/O
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.
RAID 3
RAID 1
Typically, the only way that a user or application may access files is through the file management system.
_____ represents an open file associated with a process.
Dentry object
Inode object
File object
Superblock object
An objective of the ____ is to provide a standardized set of I/O interface routines to user processes.
working directory
file management system
indexed file allocation
file directory
The ____ is concerned with scheduling disk and tape access to optimize performance.
device driver
basic I/O supervisor
access method
logical I/O
The ____ file exploits the capability found on disks to access directly any block of a known address.
direct
sequential
indexed sequential
indexed
All types of UNIX files are administered by the OS by means of inodes.
The least-complicated form of file organization is the indexed file.
The ____ contains the core parts of the operating system, including system binaries, system libraries, and configuration files.
data directory
system directory
cache directory
mnt/sdcard directory
A ____ is a contiguous set of allocated blocks.
key
pathname
pile
portion
A ___ is the basic element of data.
database
field
file
record
General-purpose computer systems far outnumber embedded systems.
The ____ module contains the code necessary for processor startup, interrupt delivery, context switching, and other functionality specific to the instruction set architecture of that processor family.
Variant
Platform
Memory Management
Architechture
The ____ module includes code for startup, chip selection configuration, interrupt controllers, and timer devices.
MMU
Configurability, direct use of interrupts, and real-time operation are some of the unique characteristics and design requirements for ______/
Tiny OS
eCos
embedded operating systems
OS service routines
______ is one of the most widely used embedded operating systems.
Resource-specific interfaces
open sources
resource requests
A key differentiator between desktop/server and embedded Linux distributions is that desktop and server software are typically compiled on one platform but is intended to be executed on another.
The _____ interface allows the client to hold on to a resource until the client is notified that someone else needs the resource.
Resource configure
Resource requested
Resource
Resource-specific
A mutex is used to enforce mutually exclusive access to a resource, allowing only one thread at a time to gain access.
_____ has become a popular approach to implementing wireless sensor network software.
TinyOS
Embedded system
Arbiter
Virtual machines are made up of files.
The solution that enables virtualization is a ____.
round robin
virtual machine monitor
hyperfile
DalviB600
The ___ facilitates the translation and I/O from the virtual machine to the physical server devices.
hardware
hypervisor
network interface card
_____ can power off and on physical hosts as they are needed.
DRS
Storage and Network I/O
DPM
Resource Scheduler
The number of guests that can exist on a single hosts is measured as a _____.
VMM ratio
hypervisor ration
broker ratio
consolidation ratio
The ____ approach is becoming a common way for businesses and individuals to deal with legacy applications and to optimize their hardware usage.
virtual machine
consolidation
ratio
Virtual machines are hosted via the infrastructure services in the VM kernel.
______ is a commercially available hypervisor from VMware that provides users a bare metal hypervisor to host virtal machines on their servers.
Zygote
Dalvi068
JVM
ESXi
A key aspect of server virtualization is that VMs cannot be viewed as network resources.
The concept of ____, as used in Linux, refers to a partitioning of the privileges available to a root user.
root isolation
hosting platform
capabilities
processing isolation