3 posts
An event is being held to celebrate a celebrity's visit, with tickets available only to the first 1,000 people. Applications will be accepted through a web application. Suppose you protect the system with a distributed lock. Are you confident that concurrency is now completely under control?
This article follows the process of solving the concurrency problems in a like feature with database locks. It explains how pessimistic locking works and examines the performance degradation caused by next-key locks.
Suppose we are designing a first-come, first-served event system. The requirements are listed below. If 1,000 people request 100 available items at the same time, how can we ensure that exactly 100 people receive one? The solutions commonly proposed in this situation are listed below.