Mechanism for improving the randomization of cache accesses utilizing abit-matrix multiplication permutation of cache addresses

作者: Kimming So , Evelyn A. Melton , Gregory F. Pfister , Vern A. Norton

DOI:

关键词:

摘要: An electronic computer system including a central processor and hierarchical memory having large relatively low speed random access small high set-associative cache data store section for storing lines of from the directory indicating, by means line identifier fields at any time, currently resident in cache, is provided with way to improve distribution across congruence classes within cache. A mechanism performing permutation operation on an M bit portion (X) address, which determines class into address will map. The performs bit-matrix multiplication said M-bit M×M matrix (where real positive integer greater than 1) produce permuted (X'). controls utilize (X') determine given automatically subsequent if one identifiers identifies, every member stored directory, matches field request CPU. If match successful accessed requested specified

参考文章(6)
Mu-Yue Hsiao, Douglas C. Bossen, Deterministic permutation algorithm ,(1982)
Richard E. Rieck, Arthur H. Nolta, John S. Williams, John H. Christian, Michael H. Hartung, David G. Reed, Method and system for handling sequential data in a hierarchical store ,(1981)
Andrew B. McNeill, Gerald A. Marazas, Gerald U. Merckel, Jerry D. Dixon, Automatic adjustment of the quantity of prefetch data in a disk cache operation ,(1981)
Robert Percy Fletcher, Daniel Bond Martin, Page controlled cache directory addressing ,(1982)
Benedicto U. Messina, William D. Silkman, Cache synonym detection and handling mechanism ,(1980)