第4章存储层次结构设计.PPT

* c1 = 1 c2 = 1 ……. Deadlock * 两个进程都在不断的改变状态，但是都无法进入 另外一种情况，是某个进程始终无法得到服务 * 注意由于turn 只有一个值，因此L:中的条件 两进程只能有一个条件满足。 * * * * * * * * * * * * * * * * * * * * * * * * * * * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * * * * * * * * * * * Sequential Consistency * Sequential concurrent tasks: T1, T2 Shared variables: X, Y (initially X = 0, Y = 10) T1: T2: Store (X), 1 (X = 1) Load R1, (Y) Store (Y), 11 (Y = 11) Store (Y’), R1 (Y’= Y) Load R2, (X) Store (X’), R2 (X’= X) what are the legiti