DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL - - PowerPoint PPT Presentation

distributed systems ii
SMART_READER_LITE
LIVE PREVIEW

DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL - - PowerPoint PPT Presentation

Prof Philippas Tsigas Distributed Computing and Systems Research Group DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Doorways Doorway is a separation mechanism of two areas. Processes which pass a doorway at


slide-1
SLIDE 1

DISTRIBUTED SYSTEMS II

A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION

Prof Philippas Tsigas

Distributed Computing and Systems Research Group

slide-2
SLIDE 2

Doorways  Doorway is a separation mechanism of two areas.  Processes which pass a doorway at time T prevent neighbor processes entering the same area at a greater time than T until exiting the doorway.

slide-3
SLIDE 3

Asynchronous Dorway

Enry Code Exit Code m1 is the I am going in message

slide-4
SLIDE 4

Behaviour

slide-5
SLIDE 5

Problem with the Asynchronous Doorway

slide-6
SLIDE 6

Synchronous Doorway  A process which desires to enter a synchronous doorway is required to wait for a situation in which all its neighbors are outside the doorway. This is implemented by checking for a process the states of its neighbors before it enters the doorway.

slide-7
SLIDE 7

Entry code: Exit code:

slide-8
SLIDE 8

What Can Go Wrong?

slide-9
SLIDE 9

What if We Combine?

slide-10
SLIDE 10