For mutual exclusion with a preemptive scheduler, it is necessary to introduce explicit locks, and machinery that makes requesting processes wait when a lock is unavailable. We considered casting our locks as semaphores, but decided that, compared with monitors, they exert too little structuring discipline on concurrent programs." How do semaphores "exert too little structuring discipline" and how is this remedied by monitors? Construct an example to show how the structuring discipline exerted by monitors could be useful.

During the course of its execution, may a single process get stalled? Your replies should be supported by rationalel

In computer graphics when looking at synchronizations when building a renderer in engine development, what are moments where locks and unlocks from mutex's would not always work when looking at synchronization for a renderer in an engine?What I mean is when developing a game engine and you'll want there to be synchronization from a renderer thread and a main thread. Where renderer thread handles flushing and executing all of the concurrent tasks, whereas main thread would handle more of the querying tasks to a render command queue, and handling how these operations are operated within the engine.Can you give me some ideas on when mutex's may not be enough in a more complex? Where you may have multiple scenes, where animation physics are applied, and various vast ideas in this perspective?On another can you give me in great details what are uses of ref counters and different variations of implementations (in C++), and why reference counters are used? And what purpose do they have, as…

Deadlocks are avoided via concurrency techniques. No handwritten responses, no one-worded, phrased, or sentenced responses, please. Please explain it to me.