Part II: Monitor Queue of entering processes Monitor waiting area Entrance MONITOR Local data Condition cl cwait (cl) Condition variables Procedure 1 Condition cn Cwait (cn) Procedure k Urgent queue csignal Initialization code Exit Figure 3. The structure of a monitor relative to concurrency. Questions: 5. Deduce at least one (1) characteristic of a monitor based on Figure 3. Elaborate on your answer. 6. Would you agree that a monitor, as a concurrency mechanism, can support process synchronization? Why or why not?

Part II: Monitor Queue of entering processes Monitor waiting area Entrance MONITOR Local data Condition cl cwait (cl) Condition variables Procedure 1 Condition cn Cwait (cn) Procedure k Urgent queue csignal Initialization code Exit Figure 3. The structure of a monitor relative to concurrency. Questions: 5. Deduce at least one (1) characteristic of a monitor based on Figure 3. Elaborate on your answer. 6. Would you agree that a monitor, as a concurrency mechanism, can support process synchronization? Why or why not?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter12: Secondary Storage Management

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

Please help 1. Please mention and explain the common concurrency mechanism (min. 3) and give an example of its use in the form of pseudo-code or program code. 2. In a system of 4 processes (A, B, C and D) and 4 resources (S, T, U and V) is running. At that time, the process is using resources such as those listed in the matrix below. The system has a total of 5 source units of S power, 5 units of T power source, 5 units of U power source and 5 units of V power source. Current Allocation S T U V A 1 1 0 2 B 1 0 1 1 C 2 2 1 1 D 0 1 3 1 The matrix below shows the resources that are still needed to be able to complete the process. Need S T U V A 1 1 0 0 B 0 0 3 0 C 3 4 1 1 D 2 1 0 1 Using Banker's algorithm, determine the sequence of processes that must be executed so that no deadlock occurs (if any).
Q2: is strict timestamp ordering used in concurrency control? Justify your answer with suitable schedules and comparing with other timestamp ordering protocol
When an optimistic strategy for concurrency management is adopted, it may commonly cause transactions to wind up taking a very lengthy time. Explain?
131. In concurrency control policy the the lock is obtained on a. Entire database b. A particular transaction alone c. All the new elements d. All of the mentioned
132. A concurrency-control policy such as this one leads to ______ performance, since it forces transactions to wait for preceding transactions to finish before they can start. a. Good b. Average c. Poor d. Unstable
Explain the distinction between a latch and a lock as used for transactional concurrency control.
Which concurrency mechanism would you suggest that might prevent the deadlock situation above? Rationalize answer. Do Execution Paths 3 and 4 encompass the first three conditions for a deadlock to occur? Explain your answer.
____ ensures that once transaction changes are done, they cannot be undone or lost, even in the event of a system failure.( ) Atomicity( ) Consistency( ) Durability( ) Isolation 2. In this technique, deadlock is handled through request time out whenever a transaction that requests a lock has not been granted the lock for a system-defined period of time. What is this technique?( ) Timeouts.( ) Wait-die timestamps.( ) Wound-wait timestamps.( ) Wait-for-graph. 3. This concurrency problem occurs when one transaction T2 can see intermediate results of another transaction T1 before T1 has been committed. What is this problem?( ) Lost update problem.( ) Uncommitted dependency problem.( ) Inconsistent analysis problem.( ) Unrepeatable read problem. 4.A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.( ) binary( ) field-level( ) shared( ) exclusive 5.Which of the following is an integrity constraint in the logical data model?( ) Required…
On page 4 Experience with Processes and Monitors in Mesa, Lampson and Redell state the following: "For mutual exclusion with a preemptive scheduler, it is necessary to introduce explicit locks, and machinery that makes requesting processes wait when a lock is unavailable. We considered casting our locks as semaphores, but decided that, compared with monitors, they exert too little structuring discipline on concurrent programs." How do semaphores "exert too little structuring discipline" and how is this remedied by monitors? Construct an example to show how the structuring discipline exerted by monitors could be useful.
What is the concept of deadlock detection and resolution in concurrency control? Describe the various deadlock detection algorithms and their trade-offs.
Transaction T1 has the following distribution over database objects A and B: R(A), W(A), R(B), W(B)Give an example of a transaction T2 that, run in parallel with transaction T1, could lead to a conflict.Assume we don't have any concurrency control.
Thank you in advance. Describe advantages and disadvantages of optimistic concurrency control.

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS