Studies show room for improvement, especially in data caches.
This paper presents a framework for studying spatial locality. It focus on the characteristics of the spatial locality in terms of closeness in time and space, to get the amount of accessed sequential data and the potential for cache hits. By using the framework, we gain knowledge for improving the cache performance. Our experiment consists of a program driven simulator and 11 important applications. In order to investigate where potential bottlenecks are located we make a simple implementation of a scheme to exploit this spatial locality.