Question 1

For a system with 16 nodes, which of the following interconnection schemes would have the smallest network diameter?

Accepted Answer

A)  4-connected 2-D mesh network 
B)  hypercube 
C)  crossbar-switch matrix 
D)  multistage network 
A)  4-connected 2-D mesh network 
B)  hypercube 
C)  crossbar-switch matrix 
D)  multistage network

Question 2

A __________ is an example of a NORMA system.

Accepted Answer

A)  network of computers 
B)  system with a large number of processors that share physical memory. Access to memory modules local to a processor is much faster than access to global memory modules. 
C)  distributed system 
D)  dual-processor personal computer 
A)  network of computers 
B)  system with a large number of processors that share physical memory. Access to memory modules local to a processor is much faster than access to global memory modules. 
C)  distributed system 
D)  dual-processor personal computer

Question 3

A separate kernels multiprocessor organization does not __________.

Accepted Answer

A)  prevent information from being shared among the various operating systems 
B)  exhibit high system fault tolerance 
C)  permit only minimal cooperation between processors 
D)  limit resource sharing 
A)  prevent information from being shared among the various operating systems 
B)  exhibit high system fault tolerance 
C)  permit only minimal cooperation between processors 
D)  limit resource sharing

Question 4

In the __________ implementation of a memory coherence protocol, all shared page updates that occur between an acquire operation and a release operation are batched as one update message after the release operation completes.

Accepted Answer

A)  lazy release consistency 
B)  delayed consistency 
C)  home-based consistency 
D)  release consistency 
A)  lazy release consistency 
B)  delayed consistency 
C)  home-based consistency 
D)  release consistency

Question 5

Why is the NUMA design more scalable than the UMA design?

Accepted Answer

A)  NUMA systems are loosely coupled, whereas UMA systems are tightly coupled. 
B)  NUMA systems reduce bus collisions when each processor's local memory services most of the processor's memory requests. By contrast, UMA systems can saturate the shared bus quickly. 
C)  NUMA systems use more than one memory module, whereas UMA systems use only one. 
D)  Memory access time is faster in NUMA systems than in UMA systems. 
A)  NUMA systems are loosely coupled, whereas UMA systems are tightly coupled. 
B)  NUMA systems reduce bus collisions when each processor's local memory services most of the processor's memory requests. By contrast, UMA systems can saturate the shared bus quickly. 
C)  NUMA systems use more than one memory module, whereas UMA systems use only one. 
D)  Memory access time is faster in NUMA systems than in UMA systems.

Question 6

A process waiting for a spin lock __________.

Accepted Answer

A)  blocks 
B)  busy-waits for the spin lock. 
C)  busy-waits for a finite amount of time, then it blocks 
D)  preempts the lock holder if its priority is higher than the lock holder's priority 
A)  blocks 
B)  busy-waits for the spin lock. 
C)  busy-waits for a finite amount of time, then it blocks 
D)  preempts the lock holder if its priority is higher than the lock holder's priority

Question 7

Attraction memory is __________.

Accepted Answer

A)  memory shared equally between all processors 
B)  serves as a shared L3 cache for processors in a multiprocessor system 
C)  memory, associated with COMA nodes, that is organized as a cache 
D)  a memory system that uses page migration and/or page replication 
A)  memory shared equally between all processors 
B)  serves as a shared L3 cache for processors in a multiprocessor system 
C)  memory, associated with COMA nodes, that is organized as a cache 
D)  a memory system that uses page migration and/or page replication

Question 8

A(n) __________ lock is useful for a situation in which__________

Accepted Answer

A)  spin lock; the system load is high 
B)  read/write lock; the protected resource is often accessed without being altered 
C)  sleep/wakeup lock; system load is light. 
D)  adaptive lock; system load is static. 
A)  spin lock; the system load is high 
B)  read/write lock; the protected resource is often accessed without being altered 
C)  sleep/wakeup lock; system load is light. 
D)  adaptive lock; system load is static.

Question 9

In an SMP system, __________ is shared between all processors.

Accepted Answer

A)  memory 
B)  I/O devices 
C)  processes 
D)  all of the above 
A)  memory 
B)  I/O devices 
C)  processes 
D)  all of the above

Question 10

How is the CC-NUMA home-based cache coherency protocol implemented when a cache miss occurs on a read?

Accepted Answer

A)  The reading node contacts the home node, which always stores the most updated version of the data item. The home node forwards the data to the requesting node. 
B)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node forwards the request to the node with the dirty copy. This node sends the data to both the home node and the requesting node. 
C)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node broadcasts a request for the dirty copy to all nodes. The node with the dirty copy sends the data to both the home node and the requesting node. 
D)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node broadcasts a request for the dirty copy to all nodes. The node with the dirty copy sends the data to the home node, which forwards it to the requesting node. 
A)  The reading node contacts the home node, which always stores the most updated version of the data item. The home node forwards the data to the requesting node. 
B)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node forwards the request to the node with the dirty copy. This node sends the data to both the home node and the requesting node. 
C)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node broadcasts a request for the dirty copy to all nodes. The node with the dirty copy sends the data to both the home node and the requesting node. 
D)  The reading node contacts the home node. If the data item is clean, the home node forwards it to the reading node. If the data item is dirty, the home node broadcasts a request for the dirty copy to all nodes. The node with the dirty copy sends the data to the home node, which forwards it to the requesting node.

Question 11

A __________ occurs when two or more processes access a resource in a nondeterministic order, and the outcome depends on the order that the processes access the resource.

Accepted Answer

A)  thundering herd 
B)  mutual exclusion violation 
C)  residual dependency 
D)  race condition 
A)  thundering herd 
B)  mutual exclusion violation 
C)  residual dependency 
D)  race condition

Question 12

The __________ is a measure of the performance of an interconnection scheme.

Accepted Answer

A)  bisection width 
B)  network diameter 
C)  node degree 
D)  number of nodes in a system 
A)  bisection width 
B)  network diameter 
C)  node degree 
D)  number of nodes in a system

Question 13

In the __________ memory coherence protocol, a write causes all nodes except the writing node to remove their copy of the modified page.

Accepted Answer

A)  invalidation 
B)  write broadcast 
C)  bus snooping 
D)  strict consistency 
A)  invalidation 
B)  write broadcast 
C)  bus snooping 
D)  strict consistency

Question 14

__________ is not an example of a technique for adding parallelism into a SISD computer?

Accepted Answer

A)  Pipelining 
B)  Superscalar execution 
C)  VLIW execution 
D)  none of the above 
A)  Pipelining 
B)  Superscalar execution 
C)  VLIW execution 
D)  none of the above

Question 15

A system exhibits __________ if the value obtained from reading a memory address is always the value that was most recently written to that address

Accepted Answer

A)  data reliability 
B)  memory coherence 
C)  data integrity 
D)  cache consistency 
A)  data reliability 
B)  memory coherence 
C)  data integrity 
D)  cache consistency

Question 16

The undivided coscheduling algorithm does not __________.

Accepted Answer

A)  permit indefinite postponement 
B)  exploit parallelism between related processes 
C)  exploit processor affinity 
D)  permit processors to remain idle if there are processes waiting to execute. 
A)  permit indefinite postponement 
B)  exploit parallelism between related processes 
C)  exploit processor affinity 
D)  permit processors to remain idle if there are processes waiting to execute.

Question 17

A symmetrical multiprocessor organization must __________, unlike master/slave and separate kernels organizations.

Accepted Answer

A)  ensure mutual exclusion to all kernel data 
B)  be able to recover from a processor failure 
C)  handle all I/O requests using only one processor 
D)  all of the above 
A)  ensure mutual exclusion to all kernel data 
B)  be able to recover from a processor failure 
C)  handle all I/O requests using only one processor 
D)  all of the above

Question 18

In the __________ load balancing algorithm, processors classify their loads as low, normal or high, send this information to other processors and use a receiver-initiated policy based on these classifications to migrate processes.

Accepted Answer

A)  drafting 
B)  bidding 
C)  diffusion 
D)  symmetric 
A)  drafting 
B)  bidding 
C)  diffusion 
D)  symmetric

Question 19

A loosely coupled system is __________ than a tightly coupled system.

Accepted Answer

A)  less fault tolerant 
B)  more flexible 
C)  more efficient 
D)  more expensive 
A)  less fault tolerant 
B)  more flexible 
C)  more efficient 
D)  more expensive

Question 20

Which job-blind process scheduling algorithm is least likely to indefinitely postpone a process?

Accepted Answer

A)  FIFO scheduling 
B)  RRprocess scheduling 
C)  SPF scheduling 
D)  The answer depends on the length of the runtime queue and the characteristics of each process so cannot be determined. 
A)  FIFO scheduling 
B)  RRprocess scheduling 
C)  SPF scheduling 
D)  The answer depends on the length of the runtime queue and the characteristics of each process so cannot be determined.

Exam 15: Understanding Multiprocessor Organizations and System Performance

For a system with 16 nodes, which of the following interconnection schemes would have the smallest network diameter?

A __________ is an example of a NORMA system.

A separate kernels multiprocessor organization does not __________.

In the __________ implementation of a memory coherence protocol, all shared page updates that occur between an acquire operation and a release operation are batched as one update message after the release operation completes.

Why is the NUMA design more scalable than the UMA design?

A process waiting for a spin lock __________.

Attraction memory is __________.

A(n) __________ lock is useful for a situation in which__________

In an SMP system, __________ is shared between all processors.

How is the CC-NUMA home-based cache coherency protocol implemented when a cache miss occurs on a read?

A __________ occurs when two or more processes access a resource in a nondeterministic order, and the outcome depends on the order that the processes access the resource.

The __________ is a measure of the performance of an interconnection scheme.

In the __________ memory coherence protocol, a write causes all nodes except the writing node to remove their copy of the modified page.

__________ is not an example of a technique for adding parallelism into a SISD computer?

A system exhibits __________ if the value obtained from reading a memory address is always the value that was most recently written to that address

The undivided coscheduling algorithm does not __________.

A symmetrical multiprocessor organization must __________, unlike master/slave and separate kernels organizations.

In the __________ load balancing algorithm, processors classify their loads as low, normal or high, send this information to other processors and use a receiver-initiated policy based on these classifications to migrate processes.

A loosely coupled system is __________ than a tightly coupled system.

Which job-blind process scheduling algorithm is least likely to indefinitely postpone a process?

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

A(n) lock is useful for a situation in which