Raymonds Algorithm Sites are arranged in a logical directed tree.
{"Image DocumentName": "Raymond\u2019s Algorithm \u2026Executing CS: getting token with the site at the top of request_q. Delete top of request_q, enter CS.", "Image ImageDescription": "Releasing CS. If request_q is non-empty, delete top entry from q, send token to that site, set holder to that site. If request_q is non-empty now, send REQUEST message to the holder site. Performance. Average messages: O(log N) as average distance between 2 nodes in the tree is O(log N). Synchronization delay: (T log N) / 2, as average distance between 2 sites to successively execute CS is (log N) / 2. Greedy approach: Intermediate site getting the token may enter CS instead of forwarding it down. Affects fairness, may cause starvation.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}