A dynamic storage scheme for conflict-free vector access

D.T. Harper, Darel A. Linebarger · 1989

Previous investigations into data storage schemes have focused on finding a storage scheme that permits conflict-free access for a set of frequently encountered access patterns. This paper considers an alternative approach. Rather than forcing a single storage scheme to be used for all access patterns, conflict-free accesses of any constant stride can be made by selecting a storage scheme for each vector based on the accessing patterns used with that vector.

Read the paper · More papers on PaperTik