-操作系统精髓与设计原理(第五版)+课后题答案1
CHAPTER 5
CONCURRENCY: MUTUAL
EXCLUSION AND SYNCHRONIZATION
Review Questions
5.1 Communication among processes, sharing of and competing for
resources, synchronization of the activities of multiple processes, and allocation of processor time to processes.
5.9 A binary semaphore may only take on the values 0 and 1. A general
semaphore may take on any integer value.
Problems
5.2 ABCDE; ABDCE; ABDEC; ADBCE; ADBEC; ADEBC; DEABC; DAEBC; DABEC; DABCE
5.5 Consider the case in which turn equals 0 and P(1) sets blocked[1] to true and then finds blocked[0] set to false. P(0) will then set blocked[0] to true, find turn = 0, and enter its critical section. P(1) will then assign 1 to turn and will also enter its critical section.