I was going though these slides (page 3) which are adapted from Computer Architecture: A Quantitative Approach, 4th Edition by Patterson and Hennessey.
The topic is about Advanced Cache Optimizations. It suggests that we can get fast hit times via small and simple caches and the reason it gives is "smaller memory takes less time to index"
I could not understand why? I mean if tags are compared in parallel. Why should the size matter?