Potpourri_3b Potpourri The context for this question is the…

Potpourri_3b Potpourri The context for this question is the same as the previous question: 3.  Recall that locks require respective atomic operations (e.g., naive spin lock uses test_&_set; ticket lock and array-based lock use fetch_&_inc; linked-list lock uses fetch&store and compare_&_swap).  In a multiprocessor system with hardware cache coherence, multiple cores keep cached copies of data consistent by invalidating or updating caches on writes. This design makes certain locks “noisier” than others—i.e., they produce more cache coherence (invalidation) traffic under contention.  b. True or False with justification. A ticket lock is often noisier than a queue-based lock (either an array-based lock or a linked-list lock) under heavy contention.