These structures can be accessed using microtags in implementations of “way prediction” within them. A common instance of the thundering herd problem in distributed systems is these structures’ namesake “stampede” under load. A circular doubly-linked list is often used to implement (-5[1])the LRU (10[2])replacement policy (10[1])within (10[2])these (10[2])structures. (10[9]-5[4])Conflict, compulsory, (10[2])capacity, (10[1]-5[1])and coherence (-5[1])are the four primary (10[2])types of “misses” (-5[2])in these structures. (10[2]-5[2])These structures (10[2])lie immediately below registers in the memory hierarchy, (10[1]-5[1])and (10[1])in modern CPUs they (10[1])are divided into (10[1])L1, (10[2])L2, (10[7])and (10[3])L3 (10[3])levels. (10[5]-5[1])For 10 points, name these structures that temporarily store data (10[2])for (-5[1])fast (10[1])access, (10[1]-5[8])which web browser users (10[1])may frequently (10[2])“clear.” (10[4])■END■ (10[15]0[3])