Final answer:
The Readers-Writers Problem is a classic concurrency issue in computer science where multiple readers can access shared data concurrently, but writers need exclusive access to write. Solutions involve the use of synchronization mechanisms like semaphores and mutexes.
Step-by-step explanation:
The classic concurrency problem referred to in the question is known as the Readers-Writers Problem. This problem arises in computing when multiple processes access a shared data area. Readers are processes that only need to read the data, whereas writers are processes that need to write to the data.
The goal is to allow multiple readers to read at the same time without interference, but to require writers to have exclusive access to the data when they write to prevent race conditions and ensure data consistency.
In addressing the Readers-Writers Problem, the challenge is to design a protocol that manages access to the data while maximising concurrency (allowing multiple readers) and avoiding conflicts with writers. Various solutions exist, including the use of semaphores, mutexes, and read-write locks to control data access. The problem exemplifies many issues related to concurrency and synchronisation in computer science.