12 Questions |
By Nhiexzz14 | Last updated: Sep 4, 2019
| Total Attempts: 52
Questions and Answers
A counting semaphore is functionally equivalent to a mutex lock because it provides a 0 or a 1 value to indicate mutual exclusion.
For thread scynchronization outside the kernel, Windows provides [Blank] . Using it, threads synchronize according to several different mechanisms, including mutex locks, semaphores, events, and timers. The system protects shared data by requiring a thread to gain ownership of a mutex to access the data and to release ownership when it is finished.
What are the two functions used when mutex locks? [Blank] and [Blank] (answer in according to the order of execution.)
Many modern computer systems therefore provide special hardware instructions that provides the solution to synchronization problem. The [Blank] operates on a single variable while the [Blank] on three variables.
There are no guarantees Peterson's solution works correctly on modern computer architectures.
The only operations that can be invoked on a condition variable are [Blank] and [Blank]. (answer in correct order of operation)
A spinlock is a type of mutex lock because the process loops while waiting for the lock to become available.
What is the term for describing the situation where shared data may be manipulated concurrently and the outcome of the execution depends upon the order of access? [Blank]
A nonpreemptive kernel is essentially free from race conditions.
How many writers may concurrently open the database with the readers-writers problem? [Blank] (answer in numeric form)
What is the term used to describe the segment of code where shared data is accessed and possibly manipulated? [Blank]
Linux uses spinlocks for both single and multiple processor systems.