analysis of vector access performance on skewed interleaved memory
Memory interleaving and memory skewing are two hardware approaches to reduce memory access conflict for many advanced computer architectures, while pipelined vector computer covers many commercially available supercomputers. The goal of this paper is to study the vector accessing behavior on skewed interleaved memory under pipelined processing environment. We establish a criterion, called average time delay, to indicate the performance of a vector access; and a criterion, called aggregate average time delay to indicate the performance of a given memory system. Under these criteria, we analyze some memory design problems. These problems centralize how to design a memory system which is cost-effective and has less conflicts for vector accesses. We also propose a software approach to reduce memory access conflict, called dimension extension strategy. This strategy performs very well under our analysis.
analysis vectorization access performance memorialized hardware conflict computer architecture computation pipeline supercomputer paper behavior process environments timing delay aggregate memory system design software extensibility strategies effect cost