Explain two-phase locking protocol, Operating System

Assignment Help:

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa.

Answer: A schedule that is authorized in the two-phase locking protocol but not in the timestamp protocol is:

1660_Explain Two-phase locking protocol.png

This schedule isn't allowed in the timestamp protocol because at step 7 the W-timestamp of B is 1.

A schedule that is permitted in the timestamp protocol but not in the two-phase locking protocol is:

2316_Explain Two-phase locking protocol1.png

This schedule can't have lock instructions added to formulate it legal under two-phase locking protocol because T1 must unlock (A) between steps 2 and 3 and must lock (B) between steps 4 and 5.


Related Discussions:- Explain two-phase locking protocol

Virtual addresses, Virtual addresses are made up of two parts: the ?rst par...

Virtual addresses are made up of two parts: the ?rst part is the page number, and the second part is an offset inside that page. Suppose our pages are 4kb (4096 = 212 bytes) long,

Can broadcast packets pass between networks, Q. Why would it be an awful id...

Q. Why would it be an awful idea for gateways to pass broadcast packets between networks? What would be the merite of doing so? Answer: All broadcasts would be spreads to all

What are the advantages and disadvantages of multithreading, What are the a...

What are the advantages and disadvantages of multithreading?  Advantages : Since by multithreading multiple executions are carried out in the same process environment t

Explain about paging, Explain about paging? Answer: Paging is a memory-...

Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble

What are the different thread levels?, What are the different thread levels...

What are the different thread levels? There are two broad type of thread implementation: User-Level Threads -- Thread Libraries. Kernel-level Threads -- System Calls.

Define paging , Paging: Only the needed memory pages are moved to main me...

Paging: Only the needed memory pages are moved to main memory from the swap machine for execution. Process size does not matter. Produce the concept of the virtual memory. It

What do you mean by first fit, What do you mean by first fit? First fit...

What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f

Explain combined ult/klt approaches, COMBINED ULT/KLT APPROACHES Idea i...

COMBINED ULT/KLT APPROACHES Idea is to merge the best of both approaches Solaris is an illustration of an OS that combines both ULT and KLT  Thread creation complete i

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd