Describ e what changes would be necessary to the producer and consumer processes in Figure 7.1 and Figure 7.2 so that a mutex lock could be used instead of a binary semaphore.

7.1 Classic Problems of Synchronization In this section, we present a number of synchronization problems as examples of a large class of concurrency-control problems. These problems are used for testing nearly every newly proposed synchronization scheme. In our solutions to the problems, we use semaphores for synchronization, since that is the 289 290 Chapter 7 Synchronization Examples while (true) f /* produce an item in next-produced*/ wait(empty); wait(mutex); /*add next-produced to the buffer/ signal (mutex); signal(full); Figure 7.1 The structure of the producer process. traditional way to present such solutions. However, actual implementations of these solutions could use mutex locks in place of binary semaphores 7.1.2 The Readers-Writers Problem Suppose that a database is to be shared among several concurrent processes. may want to update (that is, read and write) the database. We distinguish want only to read the databa 7.1 Classic Problems of Synchronization 291 while (true) { wait(ful1); wait (mutex); /remove an item from buffer to next consumed / signal (mutex); signal (empty); /*consume the item in next.consumed/ Figure 7.2 The structure of the consumer process