I have to write a report about Prime and Probe, more specifically about its eviction set method, and there are two notions that remain blurry for me :
To find the set, we use huge pages like it's described in the second link but I don't understand what the '2MB page offset' corresponds to. And why does the physical address of the huge pages contains the organization (6bits for the offset, 12bits for the set index) of the small pages (link 1) ? Are there two different types of offsets ?
To find addresses of the same slice we use the method described in the link overhead but I don't understand why :
- Between the steps 2 to 4 why is x evicted, if x is still in the S set it could remain in it when we access the whole set and in this case it wouldn't be evicted when we evict it again after that ?
- And if we remove an address from the same slice (in step 5), then all the addresses of the other slice remain so shouldn't they evict the x ?
Sorry for the confused way I must present my questions but thank you for the help :)