Question 1

Which of the following statements is a characteristic of a tightly coupled system?

Accepted Answer

A)  Components are connected indirectly through communication links. 
B)  Swapping components in to and out of the system is easier than on a loosely coupled system. 
C)  Contention can build up quickly at shared resources. 
D)  Communication is generally accomplished through message passing or shared virtual memory, but not shared physical memory. 
A)  Components are connected indirectly through communication links. 
B)  Swapping components in to and out of the system is easier than on a loosely coupled system. 
C)  Contention can build up quickly at shared resources. 
D)  Communication is generally accomplished through message passing or shared virtual memory, but not shared physical memory. C

Question 2

In a UMA multiprocessor, __________.

Accepted Answer

A)  shared virtual memory presents the illusion of shared physical memory, although physical memory is not shared. 
B)  memory access time for a given processor varies depending on which memory module contains the requested data item. 
C)  memory is viewed as a cache so that data can be migrated at the granularity of a memory line, causing a lower percentage of cache misses to be serviced remotely. 
D)  memory access time is nearly the same for all requested data items in main memory. 
A)  shared virtual memory presents the illusion of shared physical memory, although physical memory is not shared. 
B)  memory access time for a given processor varies depending on which memory module contains the requested data item. 
C)  memory is viewed as a cache so that data can be migrated at the granularity of a memory line, causing a lower percentage of cache misses to be serviced remotely. 
D)  memory access time is nearly the same for all requested data items in main memory. D

Question 3

A NUMA system more suitable for __________.

Accepted Answer

A)  a dual-processor personal computer 
B)  a cluster of workstations 
C)  a system with a large number of processors (greater than 64) inside a single machine 
D)  a large, distributed computer such as Japan's Earth Simulator 
A)  a dual-processor personal computer 
B)  a cluster of workstations 
C)  a system with a large number of processors (greater than 64) inside a single machine 
D)  a large, distributed computer such as Japan's Earth Simulator C

Question 4

In __________, the sender begins transferring dirty pages before the original process is suspended, then migrates the process when the number of dirty page remaining at the sending node reaches a lower threshold.

Accepted Answer

A)  dirty eager migration 
B)  precopy migration 
C)  lazy migration 
D)  flushing migration 
A)  dirty eager migration 
B)  precopy migration 
C)  lazy migration 
D)  flushing migration

Question 5

A migrated process's reliance on its previous node is called __________.

Accepted Answer

A)  residual dependency 
B)  lazy dependency 
C)  migration dependency 
D)  temporal dependency 
A)  residual dependency 
B)  lazy dependency 
C)  migration dependency 
D)  temporal dependency

Question 6

An advantage of eager migration over dirty eager migration is __________.

Accepted Answer

A)  less initial migration latency 
B)  that the migrating process will have more of its working set in memory immediately after it migrates 
C)  that no messages are lost during migration 
D)  none of the above 
A)  less initial migration latency 
B)  that the migrating process will have more of its working set in memory immediately after it migrates 
C)  that no messages are lost during migration 
D)  none of the above

Question 7

__________ is a goal of static load balancing algorithms.

Accepted Answer

A)  Ensuring that no processor remains idle while there is a process waiting to execute 
B)  Executing processes that communicate at the same node 
C)  Reducing the variance of response times 
D)  all of the above 
A)  Ensuring that no processor remains idle while there is a process waiting to execute 
B)  Executing processes that communicate at the same node 
C)  Reducing the variance of response times 
D)  all of the above

Question 8

Consider a system containing 18 processors and three jobs: job A contains 11 runnable processes, job B contains eight runnable processes and job C contains four runnable processes. The system contains 18 processors. If the system uses dynamic partitioning scheduling, how are processors allocated to jobs?

Accepted Answer

A)  A receives seven processors; B receives seven processors; and C receives four processors. 
B)  A receives eight processors; B receives six processors; and C receives four processors. 
C)  Each job receives six processors. 
D)  Each job receives four processors; the remaining six processors are reserved for incoming jobs. 
A)  A receives seven processors; B receives seven processors; and C receives four processors. 
B)  A receives eight processors; B receives six processors; and C receives four processors. 
C)  Each job receives six processors. 
D)  Each job receives four processors; the remaining six processors are reserved for incoming jobs.

Question 9

In which type of environment is a master/slave multiprocessor organization most appropriate?

Accepted Answer

A)  scientific computing applications in which large matrices are manipulated 
B)  cluster of workstations 
C)  interactive environment 
D)  mission-critical environment 
A)  scientific computing applications in which large matrices are manipulated 
B)  cluster of workstations 
C)  interactive environment 
D)  mission-critical environment

Question 10

A separate kernels multiprocessor organization is more appropriate for __________.

Accepted Answer

A)  a dual-processor personal computer 
B)  scientific computing applications in which large matrices are manipulated 
C)  streaming video processing 
D)  a transaction processing system that requires high fault tolerance, but little coordination 
A)  a dual-processor personal computer 
B)  scientific computing applications in which large matrices are manipulated 
C)  streaming video processing 
D)  a transaction processing system that requires high fault tolerance, but little coordination

Question 11

An adaptive lock is a mutual exclusion lock that __________.

Accepted Answer

A)  can either be held by one process in exclusive mode or several processes in shared mode 
B)  allows a process to specify the amount of time it will hold the lock; other waiting processes can use this time to determine whether to spin or block. 
C)  allows the system to change whether the lock is spinning or blocking based on the system load 
D)  allows the system to switch between allowing only kernel-mode components to hold the lock and allowing all processes to hold the lock 
A)  can either be held by one process in exclusive mode or several processes in shared mode 
B)  allows a process to specify the amount of time it will hold the lock; other waiting processes can use this time to determine whether to spin or block. 
C)  allows the system to change whether the lock is spinning or blocking based on the system load 
D)  allows the system to switch between allowing only kernel-mode components to hold the lock and allowing all processes to hold the lock

Question 12

__________ is the most fault-tolerant type of multiprocessor organization.

Accepted Answer

A)  Master/slave 
B)  Separate kernels 
C)  Symmetrical 
D)  All of the above exhibit similar levels of fault tolerance. 
A)  Master/slave 
B)  Separate kernels 
C)  Symmetrical 
D)  All of the above exhibit similar levels of fault tolerance.

Question 13

How does a system typically handle messages sent to a migrating process?

Accepted Answer

A)  All messages must be sent to the receiving node once migration starts; all messages sent to the sending node are lost. 
B)  The sending node creates a dummy process that receives messages for the migrating process. Once migration completes, the sending and receiving nodes inform other nodes of the process's new location. The dummy process forwards messages to the migrated process, and the sending node terminates the dummy process. 
C)  All messages are sent to the sending node, which forwards the messages to the new node and informs the message's sender of the process's new location. 
D)  The sending node creates a message queue to hold all messages destined for the migrating process. Once migration completes, the sending and receiving nodes inform other nodes of the process's new location. The sending node forwards the messages in the message queue to the receiving node and destroys its instance of the process. 
A)  All messages must be sent to the receiving node once migration starts; all messages sent to the sending node are lost. 
B)  The sending node creates a dummy process that receives messages for the migrating process. Once migration completes, the sending and receiving nodes inform other nodes of the process's new location. The dummy process forwards messages to the migrated process, and the sending node terminates the dummy process. 
C)  All messages are sent to the sending node, which forwards the messages to the new node and informs the message's sender of the process's new location. 
D)  The sending node creates a message queue to hold all messages destined for the migrating process. Once migration completes, the sending and receiving nodes inform other nodes of the process's new location. The sending node forwards the messages in the message queue to the receiving node and destroys its instance of the process.

Question 14

Master/slave multiprocessor organizations __________.

Accepted Answer

A)  exhibit high fault tolerance 
B)  enable many processors to execute the operating system, reducing the likelihood that contention will build up for operating system resources. 
C)  exploit hardware asymmetry (e.g., if one processor is more powerful than other processors) and known parallelism in computationally-intensive tasks. 
D)  exhibit high scalability, where adding a processor increases the system throughput by the new processor's rated capacity. 
A)  exhibit high fault tolerance 
B)  enable many processors to execute the operating system, reducing the likelihood that contention will build up for operating system resources. 
C)  exploit hardware asymmetry (e.g., if one processor is more powerful than other processors) and known parallelism in computationally-intensive tasks. 
D)  exhibit high scalability, where adding a processor increases the system throughput by the new processor's rated capacity.

Question 15

__________ is an example of a responsibility for an operating system in a multiprocessing system that does not exist in a uniprocessor system.

Accepted Answer

A)  Ensuring that processes are evenly distributed on the system's processors 
B)  Ensuring that processors operate on consistent copies of data stored throughout the system 
C)  Synchronizing execution of related processes 
D)  all of the above 
A)  Ensuring that processes are evenly distributed on the system's processors 
B)  Ensuring that processors operate on consistent copies of data stored throughout the system 
C)  Synchronizing execution of related processes 
D)  all of the above

Question 16

A page that is __________ is a good candidate for page migration.

Accepted Answer

A)  frequently read by several remote nodes, but not modified 
B)  frequently modified by several remote nodes 
C)  frequently modified by a single remote node 
D)  frequently read and modified by several remote nodes 
A)  frequently read by several remote nodes, but not modified 
B)  frequently modified by several remote nodes 
C)  frequently modified by a single remote node 
D)  frequently read and modified by several remote nodes

Question 17

In which type of environment would static load balancing be most appropriate?

Accepted Answer

A)  interactive timesharing system 
B)  scientific computing 
C)  UMA multiprocessor 
D)  Web server 
A)  interactive timesharing system 
B)  scientific computing 
C)  UMA multiprocessor 
D)  Web server

Question 18

A system might decide to migrate a process __________.

Accepted Answer

A)  to balance processor load 
B)  to reduce the cost of communication between processes that execute at different nodes before migration 
C)  to promote resource sharing 
D)  all of the above 
A)  to balance processor load 
B)  to reduce the cost of communication between processes that execute at different nodes before migration 
C)  to promote resource sharing 
D)  all of the above

Question 19

Processor affinity is the __________.

Accepted Answer

A)  relationship among processes that execute on the same processor 
B)  relationship of a process to a particular processor and its local memory and cache 
C)  likelihood that a process will execute on a particular processor 
D)  likelihood that a memory page will reside in the local memory of a particular processor 
A)  relationship among processes that execute on the same processor 
B)  relationship of a process to a particular processor and its local memory and cache 
C)  likelihood that a process will execute on a particular processor 
D)  likelihood that a memory page will reside in the local memory of a particular processor

Question 20

Which of the following job-blind process scheduling algorithms attempt to exploit processor affinity?

Accepted Answer

A)  FIFO scheduling 
B)  RRprocess scheduling 
C)  SPF scheduling 
D)  none of the above 
A)  FIFO scheduling 
B)  RRprocess scheduling 
C)  SPF scheduling 
D)  none of the above

Which of the following statements is a characteristic of a tightly coupled system?

In a UMA multiprocessor, __________.

A NUMA system more suitable for __________.

In __________, the sender begins transferring dirty pages before the original process is suspended, then migrates the process when the number of dirty page remaining at the sending node reaches a lower threshold.

A migrated process's reliance on its previous node is called __________.

An advantage of eager migration over dirty eager migration is __________.

__________ is a goal of static load balancing algorithms.

In which type of environment is a master/slave multiprocessor organization most appropriate?

A separate kernels multiprocessor organization is more appropriate for __________.

An adaptive lock is a mutual exclusion lock that __________.

__________ is the most fault-tolerant type of multiprocessor organization.

How does a system typically handle messages sent to a migrating process?

Master/slave multiprocessor organizations __________.

__________ is an example of a responsibility for an operating system in a multiprocessing system that does not exist in a uniprocessor system.

A page that is __________ is a good candidate for page migration.

In which type of environment would static load balancing be most appropriate?

A system might decide to migrate a process __________.

Processor affinity is the __________.

Which of the following job-blind process scheduling algorithms attempt to exploit processor affinity?

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

Exam 15: Understanding Multiprocessor Organizations and System Performance

Which of the following statements is a characteristic of a tightly coupled system?

In a UMA multiprocessor, __________.

A NUMA system more suitable for __________.

In __________, the sender begins transferring dirty pages before the original process is suspended, then migrates the process when the number of dirty page remaining at the sending node reaches a lower threshold.

A migrated process's reliance on its previous node is called __________.

An advantage of eager migration over dirty eager migration is __________.

__________ is a goal of static load balancing algorithms.

In which type of environment is a master/slave multiprocessor organization most appropriate?

A separate kernels multiprocessor organization is more appropriate for __________.

An adaptive lock is a mutual exclusion lock that __________.

__________ is the most fault-tolerant type of multiprocessor organization.

How does a system typically handle messages sent to a migrating process?

Master/slave multiprocessor organizations __________.

__________ is an example of a responsibility for an operating system in a multiprocessing system that does not exist in a uniprocessor system.

A page that is __________ is a good candidate for page migration.

In which type of environment would static load balancing be most appropriate?

A system might decide to migrate a process __________.

Processor affinity is the __________.

Which of the following job-blind process scheduling algorithms attempt to exploit processor affinity?

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters