3.4 Concurrency: Time Is of the Essence

3.4.2 Mechanisms for Controlling Concurrency

Exercises:

• 3.39 . Remaining possibilities
• 3.40 . All possible values of x
• 3.41 . Serialized make-account
• 3.42 . Make-account changing
• 3.43 . Timing diagrams
• 3.44 . The problem of transferring an amount from one account to another
• 3.45 . Redefine accounts
• 3.46 . Draw a timing diagram
• 3.47 . Implementations of semaphores
• 3.48 . Serialized-exchange with the deadlock-avoidance method
• 3.49 . Scenario where the deadlock-avoidance mechanism does not work