Dealing With Contention easy
What is a FIFO (First-In-First-Out) Lock (Fair Lock)?
- A A lock that grants access in the order requests were received.
- B A lock that picks a random thread.
- C A lock that prefers the fastest thread.
- D A lock that never blocks.
Answer: A. A lock that grants access in the order requests were received.
Fair locks prevent starvation but can decrease throughput due to scheduling overhead.
One system design question a day, with spaced repetition so the ones you miss come back.
Get the appRelated questions
- Why is 'Exponential Backoff' preferred over constant intervals for retries?
- What is the primary purpose of a Mutex (Mutual Exclusion) lock?
- Why does adding more threads sometimes *decrease* performance?
- In a Saga, if a Compensating Transaction (Undo) fails repeatedly due to contention, what is the last resort?
- In a database, what happens if Transaction A locks a row and Transaction B tries to modify the same row?
- A database restart causes thousands of application servers to instantly try to reconnect. This crashes the DB again. This is called: