CSC 7103 20090922

CSC 7103 20090922 - The current pointer points to the...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 7103 9/22/2009 Page 1 of 2 ….back to Voting Scheme Figure 1 – Quorum layout Token based Mutual Exclusion Tree based No global knowledge of token or request queue. Each node has a request queue. Deadlocks don’t exist because only the token holder can enter the critical section. Starvation does not exist either. The only real problem with the scheme is the time required for messages to reach the destination. This is called Raymond’s algorithm . An improved version uses a current pointer and a next pointer.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: The current pointer points to the person who you guess will have the token next. The next pointer points to the node which will receive the token after processing is finished. If a message is received, it is forwarded via the CSC 7103 9/22/2009 Page 2 of 2 current pointer, the current pointer is updated, and forwards the request on so that the correct next queue is updated....
View Full Document

This note was uploaded on 01/25/2010 for the course CSC 7103 taught by Professor Kannan,r during the Fall '08 term at LSU.

Page1 / 2

CSC 7103 20090922 - The current pointer points to the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online