WGU C191 Module 2 questions with verified
answers
- penguins play w/ cool arctic melted ice
Process state, Program counter, CPU registers, Accounting information, memory-
management info, and I/O status information. Ans✓✓✓-What does the PCB(info
associated with each process) contain?
-Ensuring there is a sufficient number of cores
-Determining if data can be separated so that it is accessed on separate cores
-Identifying data dependencies between tasks Ans✓✓✓-What are some
challenges when designing applications for multicore systems?
1. Protects access to every critical data item, does one of two things;
2. If the lock is held by a thread that is currently running on another CPU, the
thread spins while waiting for the lock to become available, because the thread
holding the lock is likely to finish soon.
3. If the thread holding the lock is not currently in run state, the thread blocks,
going to sleep until it is awakened by the release of the lock. Ans✓✓✓-What are
three qualities of adaptive mutex locks?
1. push migration
2. pull migration Ans✓✓✓-What are the two general approaches to load
balancing?
,1. Signal is generated by particular event
2. Signal is delivered to a process
3. Signal is handled Ans✓✓✓-What are the steps of the signal handler(which are
using in UNIX systems to notify a process that a particular event has occurred)?
1. The parent continues to execute concurrently with its children.
2. The parent waits until some or all of its children have terminated.
3. The child process is a duplicate of the parent process (it has the same program
and data as the parent).
4. The child process has a new program loaded into it. Ans✓✓✓-When a parent
creates a child process what are the possibilities?
Advantages of a Cooperating process Ans✓✓✓-Information sharing
Computation speed-up
Modularity
Convenience
ALPC(advanced local procedure call) Ans✓✓✓-The scheme in which the sender
process and the receiver process must name the other to communicate
alternative approaches Ans✓✓✓-- transactional memory
- openMP
- functional programming languages
anonymous pipes Ans✓✓✓-Windows version of ordinary pipes
,APC(asynchronous procedure call) Ans✓✓✓-Enables a user thread, when it
receives notification of a particular event, to specify a function that is to be
called .
Asymmetric multiprocessing Ans✓✓✓-One processor handles all scheduling
decisions and I/O processing(master server). Reduces need for data sharing.
Asymmetric Multiprocessing Ans✓✓✓-only one processor accesses the system
data structures, alleviating the need for data sharing
Asynchronous Cancellation and Deferred Cancellation Ans✓✓✓-What are the
two general approaches to canceling threads(terminating threads before it has
finished)?
Asynchronous Cancellation Ans✓✓✓-Terminates the target thread immediately
Asynchronous Ans✓✓✓-Is non-Blocking synchronous or asynchronous?
- non-blocking send has sender send message and continue
- non-blocking receive has receiver receive valid message or null
Blocking or non-Blocking Ans✓✓✓-What are the two types of message passing?
Bounded Buffer Problem Ans✓✓✓--N buffers, each can hold one item
-Semaphore mutex initialized to the value 1
-Semaphore full initialized to the value 0
, -Semaphore empty initialized to the value N.
bounded waiting Ans✓✓✓-A bound must exist on the number of times that
other processes are allowed to enter their critical sections after a process has
made a request to enter its critical section and before that request is granted
Bounded-buffer Ans✓✓✓-Assumes that there is a fixed buffer size
bridge crossing example Ans✓✓✓-- If a deadlock occurs, it can be resolved if one
car backs up (preempt resources and rollback)
- starvation possible
buffering Ans✓✓✓-Queue of messages attached to a link; implemented in one of
three ways:
1. Zero Capacity - 0 messages (sender must block until received)
2. Bounded capacity - finite messages (sender must wait if link full)
3. Unbounded capacity - infinite length (sender never waits)
Cascading Termination Ans✓✓✓-The technique of terminating all child processes
when a parent process terminates.
circular wait Ans✓✓✓-there exists a set {P0, P1, ..., Pn} of waiting processes such
that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource
that is held by P2, ..., Pn-1 is waiting for a resource that is held by Pn, and Pn is
waiting for a resource that is held by P0.
Classical Problems of Synchronization Ans✓✓✓-Bounded-Buffer Problem
answers
- penguins play w/ cool arctic melted ice
Process state, Program counter, CPU registers, Accounting information, memory-
management info, and I/O status information. Ans✓✓✓-What does the PCB(info
associated with each process) contain?
-Ensuring there is a sufficient number of cores
-Determining if data can be separated so that it is accessed on separate cores
-Identifying data dependencies between tasks Ans✓✓✓-What are some
challenges when designing applications for multicore systems?
1. Protects access to every critical data item, does one of two things;
2. If the lock is held by a thread that is currently running on another CPU, the
thread spins while waiting for the lock to become available, because the thread
holding the lock is likely to finish soon.
3. If the thread holding the lock is not currently in run state, the thread blocks,
going to sleep until it is awakened by the release of the lock. Ans✓✓✓-What are
three qualities of adaptive mutex locks?
1. push migration
2. pull migration Ans✓✓✓-What are the two general approaches to load
balancing?
,1. Signal is generated by particular event
2. Signal is delivered to a process
3. Signal is handled Ans✓✓✓-What are the steps of the signal handler(which are
using in UNIX systems to notify a process that a particular event has occurred)?
1. The parent continues to execute concurrently with its children.
2. The parent waits until some or all of its children have terminated.
3. The child process is a duplicate of the parent process (it has the same program
and data as the parent).
4. The child process has a new program loaded into it. Ans✓✓✓-When a parent
creates a child process what are the possibilities?
Advantages of a Cooperating process Ans✓✓✓-Information sharing
Computation speed-up
Modularity
Convenience
ALPC(advanced local procedure call) Ans✓✓✓-The scheme in which the sender
process and the receiver process must name the other to communicate
alternative approaches Ans✓✓✓-- transactional memory
- openMP
- functional programming languages
anonymous pipes Ans✓✓✓-Windows version of ordinary pipes
,APC(asynchronous procedure call) Ans✓✓✓-Enables a user thread, when it
receives notification of a particular event, to specify a function that is to be
called .
Asymmetric multiprocessing Ans✓✓✓-One processor handles all scheduling
decisions and I/O processing(master server). Reduces need for data sharing.
Asymmetric Multiprocessing Ans✓✓✓-only one processor accesses the system
data structures, alleviating the need for data sharing
Asynchronous Cancellation and Deferred Cancellation Ans✓✓✓-What are the
two general approaches to canceling threads(terminating threads before it has
finished)?
Asynchronous Cancellation Ans✓✓✓-Terminates the target thread immediately
Asynchronous Ans✓✓✓-Is non-Blocking synchronous or asynchronous?
- non-blocking send has sender send message and continue
- non-blocking receive has receiver receive valid message or null
Blocking or non-Blocking Ans✓✓✓-What are the two types of message passing?
Bounded Buffer Problem Ans✓✓✓--N buffers, each can hold one item
-Semaphore mutex initialized to the value 1
-Semaphore full initialized to the value 0
, -Semaphore empty initialized to the value N.
bounded waiting Ans✓✓✓-A bound must exist on the number of times that
other processes are allowed to enter their critical sections after a process has
made a request to enter its critical section and before that request is granted
Bounded-buffer Ans✓✓✓-Assumes that there is a fixed buffer size
bridge crossing example Ans✓✓✓-- If a deadlock occurs, it can be resolved if one
car backs up (preempt resources and rollback)
- starvation possible
buffering Ans✓✓✓-Queue of messages attached to a link; implemented in one of
three ways:
1. Zero Capacity - 0 messages (sender must block until received)
2. Bounded capacity - finite messages (sender must wait if link full)
3. Unbounded capacity - infinite length (sender never waits)
Cascading Termination Ans✓✓✓-The technique of terminating all child processes
when a parent process terminates.
circular wait Ans✓✓✓-there exists a set {P0, P1, ..., Pn} of waiting processes such
that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource
that is held by P2, ..., Pn-1 is waiting for a resource that is held by Pn, and Pn is
waiting for a resource that is held by P0.
Classical Problems of Synchronization Ans✓✓✓-Bounded-Buffer Problem
