Predictive sequential associative cache tries to combine the best features of various sequential probe two way set associative caches such as making use of rehash bit to avoid extra probes and using the MRU bit to implement a true LRU replacement policy. Besides predicting the index on the steering bit table minimizes delay. Due to the above features cache occupancy which is an important metric in avoiding conflicts is much smaller compared to column associative cache. Our simulation study showed that all the techniques had comparable latency, with PSA-cache having the lowest occupancy. The PSA(eff) design has the best performance but PSA(xor) is easier to implement and has a shorter access time.