Current data cache organizations of scalar processors fail to deliver good performance for many vector applications. There are two main reasons for this loss of performance: the use of the same organization for caching both spatial and temporal locality and the "eager" caching policy used by caches. The first issue has led to the well-known trade-off of designing caches with a line size of a few tens of bytes. However, for memory reference patterns with a low spatial locality a significant pollution is introduced. On the other hand, when the spatial locality is high, larger lines could be more convenient. The eager caching policy refers to the fact that data that miss the cache and is required by the processor is always cached (excepting writes in a no write allocate cache). However, it is common in numerical applications to have large working sets (large vectors, larger than the cache size), that result on a swept of the cache without any opportunity to exploit temporal locality. In a...