Skewed-Associative 캐시를 위한 선형 해시 함수의 구성

Abstract

A hash function H is a computationally efficient function that maps bitstrings of arbitrary length to bitstrings of fixed length, called hash values. Hash functions have a variety of general computational uses. In this paper, we construct new XOR-based hash functions by using the concepts of rank and null space. These are conflict-free hash functions which are different type according to the number of output bitstrings is even or odd. To apply the constructed hash functions to the skewed-associative cache, we show that the degree of interbank dispersion between two hash functions is maximal.