Lock management in a distributed system

Lock management in a distributed system:

To replicate the discussion in the section OIL distributed transaction management, if a transaction wants to do work at a new node, some process of the transaction must request that the node construct a cohort as well as that the cohort go into session with the requesting process (see section on data communications for a discussion of sessions.) The picture below illustrates this.

1473_lock management in distributed system.jpg

A cohort carries both the transaction name T1 as well as the process name (in NODE1 the cohort of T1 is process P2 and in NODE2 the cohort of T1 is process P6.)

The two processes are able to nor converse and carry out the work of the transaction. If one process aborts, they must both abort, as well as if one process commits, they must both commit.

The lock manager of every node can keep its lock tables in any form it desires. Additional deadlock detectors running in every node may use any technique they like to detect deadlocks among transactions that run exclusively in that node. We call such deadlocks as local deadlocks. Nevertheless, just for the reason that there are no cycles in the local wait-for graph, doesn’t mean that there are no cycles. Gluing acyclic local graphs collectively might produce a graph with cycles (See the illustration bellow.) Therefore the deadlock detectors of every node will have to agree on a common protocol in order to handle deadlocks involving distributed transactions. We call such deadlocks as global deadlocks.

Inspection of the following figure may perhaps help to understand the nature of global deadlocks. Note that transaction T1 has two processes Pl as well as P2 in nodes 1 and 2 respectively. Pl is session-waiting for its cohort P2 to do few works. P2 in the process of doing this work needed access to FILE2 in NODE2. However FILE2 is locked exclusive by another process (P4 of NODE2) thus P2 is in lock wait state. Therefore the transaction T1 is waiting for FILE2. Now Transaction T2 is in a alike state one of its cohorts is session waiting for the other which in turn is lock waiting for FILE1. Indeed transaction T1 is waiting for FILE2 which is granted to transaction T2 that is waiting for file FILE1 that is granted to transaction T1. A global deadlock if you forever saw one.

626_global deadlock.jpg

The notion of wait-for graph should be generalized to handle global deadlock. The nodes of the graph are processes as well as resources (sessions are resources). The edges of the graph are constructed as go after:

• Draw a directed edge empty a process to a resource if - the process is in lock wait for the resource - or the process is in session-wait for the resource (session)-

• Depict a directed edge from a resource to a process if - the resource is lock granted to the process - or it is a session of the process as well as the process is not in session-wait on it.

A local deadlock is a
lock wait ->. . . .-> lockwait cycle.

A global deadlock is a
lockwait->... -> sessionwait -> lockwait ->...-> sessionwait cycle

Latest technology based Operating System Online Tutoring Assistance

Tutors, at the www.tutorsglobe.com, take pledge to provide full satisfaction and assurance in Operating System help via online tutoring. Students are getting 100% satisfaction by online tutors across the globe. Here you can get homework help for Operating System, project ideas and tutorials. We provide email based Operating System help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Operating System. Through Online Tutoring, you would be able to complete your homework or assignments at your home. Tutors at the TutorsGlobe are committed to provide the best quality online tutoring assistance for Operating System Homework help and assignment help services. They use their experience, as they have solved thousands of the Operating System assignments, which may help you to solve your complex issues of Operating System. TutorsGlobe assure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide the homework help as per the deadline or given instruction by the student, we refund the money of the student without any delay.

2015 ©TutorsGlobe All rights reserved. TutorsGlobe Rated 4.8/5 based on 34139 reviews.