0

9.0kviews

Compare and contrast mutual exclusion algorithms.

written 8.7 years ago by teamques10 ★ 68k

•   modified 2.8 years ago

distributed systems

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

1

564views

written 8.7 years ago by teamques10 ★ 68k

modified 2.8 years ago by temehabtam811 • 30

Parameters	Centralized algorithm	Distributed algorithm	Token Ring algorithm
Election	One process is,elected as coordinator	Total ordering of all events in the system	Uses token for entering critical section
Messages per entry/exit	Requires three messages to enter and exit a critical region	Requires 2(n-1) messages	Variable number of messages required.
Delay in message times	Delay for messages is 2 messages	Delay for messages is 2(n-1)	The time varies from 0 to n-1 tokens
Mutual exclusion	Guarantees mutual exclusion	Mutual exclusion guaranteed without dead lock	Mutual exclusion is guaranteed
Starvation	No starvation	No starvation	No starvation
Complexity	Easy to implement	Complicated process	Implementation is easy
Used for	Used for general allocation	Used for small group processes that do not change group membership	Used processes in ring configuration
Problems	Entire system can go down due to single point of failure, Bottleneck	N points of failure	Detecting the lost token and regeneration is difficult
Expense	Less expensive	More expensive	Less expensive
Robustness	More robust	Less robust	More robust

ADD COMMENT SHARE EDIT