61. No preemption means that a resource is released as
Correct! "No preemption" is a deadlock condition where a resource can only be released voluntarily by the process holding it, after it has finished its task.
62. Deadlock avoidance requires knowledge of future...
Correct! Avoidance algorithms (like the Banker's Algorithm) need to know the maximum future resource requests of each process to ensure the system remains in a safe state.
63. The circular wait condition can be prevented by defining a linear ordering of...
Correct! If resources are assigned a numerical order and processes must request them in ascending order, a circular wait (a closed chain of processes waiting for each other) becomes impossible.
64. An unsafe state is of course a state that is not...
Correct! In Deadlock Avoidance, a state is "unsafe" if the system cannot guarantee that all processes can finish execution (i.e., it is not "Safe").
65. Linux includes all of the concurrency mechanisms that can be found in...
Correct! Linux is a UNIX-like operating system and inherits standard UNIX concurrency tools like pipes, messages, and signals.
66. The dining philosophers' problem can be seen as representative of...
Correct! It is a classic problem used to represent a large class of concurrency control problems and deadlock scenarios.
67. A direct method of deadlock prevention is to prevent the occurrence of a circular...
Correct! "Circular Wait" is one of the four necessary conditions for deadlock. Preventing it (e.g., by ordering resources) prevents deadlock.
68. To solve the dining philosophers, the monitor consists of two...
Correct! A Monitor solution typically exposes two procedures for the philosophers to call:
pickup() and putdown().69. The conditions for deadlock includes to have only one process using a resource at a...
Correct! This refers to "Mutual Exclusion"—only one process can use a resource at a time.
70. A useful tool in characterizing and allocating of resources to process is the...
Correct! The Resource Allocation Graph (RAG) visually shows processes, resources, and the edges (claims/allocations) between them to detect deadlocks.
71. UNIX provides a variety of mechanisms for inter processor...
Correct! This is referred to as IPC (Inter-Process Communication), which includes pipes, shared memory, and messages.
72. Deadlock involves reusable...
Correct! Deadlocks typically occur when processes are competing for reusable resources (like memory, processors, or I/O channels).
73. Once deadlock has been detected, some strategy is needed for...
Correct! After detection, the system must "Recover" by aborting processes or preempting resources to break the deadlock.
74. The common technique used for protecting a critical section in Linux is the...
Correct! Spinlocks are widely used in the Linux kernel for short critical sections because they avoid the overhead of context switching.
Chapter 3: Concurrency Mutual Exclusion and Synchronization
75. For procedure, the system prevents the overlap of buffer...
Correct! In producer/consumer problems, the system must ensure that buffer operations (read/write) do not overlap destructively.
76. For a single processor system, implementation of semaphores is possible to inhibited through...
Correct! On a single CPU, mutual exclusion can be achieved by simply disabling (inhibiting) interrupts briefly so the current process isn't preempted.
77. In message passing a process receives information by executing the...
Correct! Message passing relies on two primitives:
send() to transmit data and receive() to accept data.78. In a uniprocessor system concurrent processes cannot have overlapped...
Correct! On a single processor, processes are interleaved (switched rapidly) but they never literally execute at the exact same instant (overlap).
79. In addressing, a many to one relationship is useful for...
Correct! Many clients sending messages to "one" server (e.g., a printer server or file server) is a classic Client/Server pattern.
80. The controller process services write a...
Correct! In standard concurrency models (like Readers/Writers), a controller services "Requests" from other processes.
0 Comments