In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. If TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

The database system is both deadlock-free and starvation-free.
The database system is deadlock-free but not starvation-free.
The database system is starvation-free, but not deadlock-free.
The database system is neither deadlock-free nor starvation-free.

LohaHridoy

4 views

2025-01-04 04:42

1 Answers

AhmedNazir

Option 1 : The database system is both deadlock-free and starvation-free.

Concept:

Wound – wait scheme means the newer transactions are killed when an older transaction make a request for a lock being held by newer transaction.

Explanation:

Here, Unique timestamps are assigned to each transaction using Lamport’s logical clock.

1) Now, first check if is it wound – wait scheme?

If TS(T₂) < TS(T₁) then

T₁is killed

else T₂waits.

This logic comes under wound – wait scheme, because it is given that T₁ holds a lock on the resource R and T₂ has requested a lock on same resource R. When T₂ requests, T₁ is killed because timestamp of T₁is larger than T₂ means T₁ is the newer transaction.

2) Now, wound – wait avoid starvation or not?

As newer transaction dies and restart with same timestamp and older one survives so after older transaction new will definitely execute. It means no possibility of starvation.

3) Deadlock free or not?

As, there is no starvation in this means no deadlock possibility.

4 views Answered 2022-09-04 04:29

Related Questions

Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?

1 Answers 5 Views

A database of research articles in a journal uses the following schema. (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE) The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema. (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE (VOLUME, NUMBER) → YEAR (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE The database is redesigned to use the following schemas. (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE) (VOLUME, NUMBER, YEAR) Which is the weakest normal form that the new database satisfies, but the old one does not ?

1 Answers 4 Views

A multithreaded program P executes with x number of threads used y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-re-entrant. i.e. if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of p can result in a deadlock are:?

1 Answers 4 Views

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements: I) Minimum Spanning Tree of G is always unique. II) Shortest path between any two vertices of G is always unique. Which of the above statements is/are necessarily true?

1 Answers 5 Views

Two statements are given followed by two conclusions I and II. You have to consider these statements to be true, even if they seem to be at variance with commonly known facts and choose which f the given conclusions logically follow(s) from the given statements. Statements : All Chairs are expensive All expensive are unique. Conclusion : I. All chairs are unique. II. All unique are expensive.?

1 Answers 4 Views

Let G be any connected, weighted, undirected graph. I. G has a unique minimum spanning tree, if no two edges of G have the same weight. II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut. Which of the above two statements is/are TRUE?

1 Answers 4 Views

Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE?

1 Answers 4 Views

A boatman wants to cross a river which distance is 80 km. In the starting boatman goes to 20 km and then turn 90 degree anti-clock wise and goes 60 km in upstream after that he turn 90 degree clock wise and goes 40 km. After that he turn 90 degree clock wise and goes 60 km. In the end he turn 90 degree anti-clock wise and goes 20 km and reach his destination. The speed of boatman is 22 km/hr and speed of stream is 4 km/hr. Find the time to cover total distance?

1 Answers 4 Views

Read he following statements carefully: 1.The National Institute of Rural Development and Panchayati Raj (NIRDPR) launched a training programme. 2.It is of Sustainable Livelihoods and Adaptation to Climate Change (SLACC) to help Rural Poor Farm Holds adapt to Climate Change and sustain their livelihoods. 3.The first batch Community Resource Persons and National Resource Persons from Madhya Pradesh and Maharashtra states have begun receiving training classes in Hyderabad. Which of the above statements is/are correct?

1 Answers 4 Views

In the following question below are given three statements followed by three conclusions. Taking the given statements to be true even if they seem to be at variance from commonly known facts, read all the conclusions and then decide which of the given conclusion logically follows the given statements. Statements: I. All Key are Lock. II. No Lock is Mat. III. All Mat are Glass. Conclusions: I. Some Glass being a Lock is a possibility. II. Some Glass are Key. III. No Key is Mat.?

1 Answers 4 Views

এক্সাম দিয়ে মেধা যাচাই করুন

Job Preparation (1125)

Admission (754)

এসএসসি (10)

এইচএসসি (5)