1 / 10

Distributed systems II A polynomial local solution to Mutual Exclusion

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.

ina
Download Presentation

Distributed systems II A polynomial local solution to Mutual Exclusion

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Prof Philippas Tsigas Distributed Computing and Systems Research Group Distributedsystems IIA polynomial local solution to Mutual Exclusion

  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.

  3. Asynchronous Doorway EnryCode ExitCode m1 is the “I am going in” message

  4. Behaviour

  5. Problem with the AsynchronousDoorway

  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.

  7. Entrycode: Exitcode:

  8. What Can Go Wrong?

  9. WhatifWeCombine?

More Related