STACK CACHE MEMORY

The gap between processor and memory speed appears as a serious bottleneck in improving the performance of the current computers architectures. The prefetch methods appear as one of the most promising way for filling this gap. The known prefetch methods do not distinguish the prefetched data based on their locality in the virtual memory and thus they can not exploit their specific characteristics. In this paper is described a novel approach for effectively prefetching and caching stacks data, which have a clear spatial and temporal characteristics. The showed results, 99 % hits ratio for 2KB cache, confirm our believing that exploiting these characteristics gives good results