Name
Abstract | ||
|---|---|---|
Stringent power and performance constraints, coupled with detailed knowledge of the target applications of a processor, allows for application-specific processor optimizations. It has been shown that application-specific reconfigurable hash functions eliminate a large number of cache conflict misses. These hash functions minimize conflicts by modifying the mapping of cache blocks to cache sets. This paper describes an algorithm to compute optimal XORfunctions, a particular type of hash functions based on XORs. Using this algorithm, we set an upper bound on the conflict reduction achievable with XOR-functions. We show that XOR-functions perform better than other reconfigurable hash functions studied in the literature such as bit-selecting functions. The XOR-functions are optimal for one particular execution of a program. However, we show that optimal XOR-functions are less sensitive to the characteristics of the execution than optimal bit-selecting hash functions. This again underlines that XOR-functions are the best known hash functions to implement reconfigurable hash functions. |
Year | Venue | Keywords |
|---|---|---|
2008 | Lecture Notes in Computer Science | optimal bit-selecting hash function,hash function,optimal xor-functions,application-specific reconfigurable hash function,application-specific processor optimizations,cache block,reconfigurable hash function,bit-selecting function,optimal xorfunctions,cache conflict,upper bound,cache memory,hashing |
Field | DocType | Volume |
Hash filter,Hash tree,Double hashing,Computer science,Cryptographic hash function,Parallel computing,Collision resistance,SWIFFT,Hash function,Security of cryptographic hash functions | Conference | 4934 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-78152-8 | 3 |
PageRank | References | Authors |
0.45 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hans Vandierendonck | 1 | 629 | 54.43 |
| Koen De Bosschere | 2 | 1659 | 117.74 |