mutex lock is a hardware solution to critical-section problem Solutions to the critical section problem may suffer from liveness failures.The difference is that nginx really works. the general rule of thumb is to use a mutex lock if the lock will be held for a duration less than two context switches A.
#Implies flaticon software#
mutex lock is a higher-level software solution to critical-section problemĭ. mutex lock is a hardware solution to critical-section problemī. True Which of the following regarding mutex lock is NOT true?Ī. True The preemptive kernel may be more responsive than non-preemptive kernel.ī. False Spinlocks are not appropriate for single-processor systems.ī. Bounded waiting implies progress, and progress implies no deadlock CAS-based synchronization is always faster than traditional synchronization.ī. Bounded waiting implies no deadlock, and no deadlock implies progress B. Progress implies no deadlock, and no deadlock implies bounded waitingĭ. Bounded waiting implies progress, and progress implies no deadlockĬ. No deadlock implies progress, and progress implies bounded waitingī. Since semaphore and mutex lock are tools for synchronization, process that have used semaphores or mutex locks should not cause deadlocks Which of the following is true for the solutions to critical-section problems?Ī. a set of processes is in a deadlocked state when every process in the set is waiting for an event that can be caused only by another process in the setĭ. Semaphores and mutex locks may be shared resources that difference processes contend for, and hence deadlocks may occurĬ. Since semaphore and mutex lock are tools for synchronization, process that have used semaphores or mutex locks should not cause deadlocksī. False Which of the following is NOT true?Ī. False When the mutex lock is implemented based on a binary semaphore, it should be initialized to be 0.ī. True Mutex locks and counting semaphores are essentially the same thing.ī.
True Bounded waiting implies progress, and progress implies mutual exclusion.ī. Deadlock doesn't imply starvation The preemptive kernel is more suitable for real-time programming than non-preemptive kernel.ī. True A mutex lock is released immediately after entering a critical section.ī. It suffers from the busy waiting problem Race conditions can result in corrupted values of shared data.ī. A process that is suspended, waiting on the semaphore, should be restarted when some other process executes a signal() operation. When a process executes the wait() operation and finds that the semaphore value is not positive, it will suspend itselfĭ. Semaphore has a waiting queue associated with the semaphoreĬ. It suffers from the busy waiting problemī. critical section Which of the following is NOT true regarding semaphore implementation?Ī. progress In _, the process may be changing common variables, updating a table, writing a file, and so on.ĭ. both of the above Which of the following critical-section problem's requirements ensures programs will cooperatively determine what process will next enter its critical section?ĭ. True Which of the following actions should be performed among cooperating processes?ĭ. all of the above Semaphore implementation overcomes the busy waiting problem.ī. True Which of the following may cause a liveness failure?ĭ. False Semaphores and mutex locks both provide mutual exclusion.ī. both of the above The value of a counting semaphore can range only between 0 and 1.ī. when race condition occurs, the outcome of the execution depends on the particular order in which the access takes placeĭ. race condition occurs where several processes access and manipulate the same data concurrentlyī. bounded waiting implies progress Which of the following is true for race condition?Ī. Which of the following is true regarding the requirements for the solutions to critical-section problem?ĭ. Spinlocks can be used to prevent busy waiting in the implementation of semaphore. Counting semaphores can be used to control access to a resource with a finite number of instances. Spinlocks can be used to prevent busy waiting in the implementation of semaphore.ĭ. A binary semaphore can never be used as a counting semaphore.Ĭ. A counting semaphore can never be used as a binary semaphore.ī. Which of the following statements is true?Ī.
0 kommentar(er)
