Definition 2.8.2

A covering state for a lock

object is one in which there is

at least one thread about to

write to each shared location,

but the lock objects locations

look like the CS (critical section) is empty

(that is, state is compatible with

a global state in which no

thread is in the CS or trying to enter).

Question 8 (1 point) Saved Consider the proof of the lower bound on the number of locations for three threads and two registers. Let thread A run until it is poised to write to location LA. Let thread B run until it is poised to write to location LB- Then, let B write some information to LB, to indicate that B has entered the critical section. Then, let B write some information to LB, to indicate that B has left the critical section. What are, for certain, properties of this state? It is in both a covering state and an inconsistent state. It is in a covering state. It is in an inconsistent state. It is in neither a covering state nor an inconsistent state. Question 8 (1 point) Saved Consider the proof of the lower bound on the number of locations for three threads and two registers. Let thread A run until it is poised to write to location LA. Let thread B run until it is poised to write to location LB- Then, let B write some information to LB, to indicate that B has entered the critical section. Then, let B write some information to LB, to indicate that B has left the critical section. What are, for certain, properties of this state? It is in both a covering state and an inconsistent state. It is in a covering state. It is in an inconsistent state. It is in neither a covering state nor an inconsistent state