When x1, ..., xN proceses try to access some A resource, how does the OS know the particular solution to use for handling the issue of concurrency?
If A is serially reusable then the solution can be a mutex semaphore, but how does the OS identify A as serially reusable? And what's the logic used for creating and accessing the structures used for handling its concurrent use?
How does it do the same thing for resources that match the other concurrency problems: producer-consumer, readers-writers, and philosophers.