[Solved]Consider Large Hashtable Data Structure Billion Hash Buckets Currently Hashtable Holds 102 Q37269830

Consider a very large hashtable data structure with a billion hash buckets. Currently, the hashtable holds 1024 items, where each item is 8 bytes, containing a 4-byte key and a 4 byte value. Assume the hashtable uses an ideal random function for hashing and is, therefore, collision-free What are all the allowable cacheline sizes (choose one or more from: 8 bytes, 16 bytes, 32 bytes, and 64 bytes) for a cache to simultaneously hold all 1024 hash items, assuming the cache is fully-associative and has a capacity of 16 kilobytes? Hint: The 1024 items are all stored in far-apart memory addresses due to the large size of the hashtable and the ideal random hashing function. In other words, you have an extremely large array of items, in which the items are scattered in a more-or-less uniform way, and in which it is extremely unlikely that any two items are close together. Show transcribed image text Consider a very large hashtable data structure with a billion hash buckets. Currently, the hashtable holds 1024 items, where each item is 8 bytes, containing a 4-byte key and a 4 byte value. Assume the hashtable uses an ideal random function for hashing and is, therefore, collision-free What are all the allowable cacheline sizes (choose one or more from: 8 bytes, 16 bytes, 32 bytes, and 64 bytes) for a cache to simultaneously hold all 1024 hash items, assuming the cache is fully-associative and has a capacity of 16 kilobytes? Hint: The 1024 items are all stored in far-apart memory addresses due to the large size of the hashtable and the ideal random hashing function. In other words, you have an extremely large array of items, in which the items are scattered in a more-or-less uniform way, and in which it is extremely unlikely that any two items are close together.
Expert Answer
Answer to Consider a very large hashtable data structure with a billion hash buckets. Currently, the hashtable holds 1024 items, w… . . .
OR

