> 1. Not using supplemental hash function will result in severe clustering when we move to sequential block IDs (as only higher bits are used for hash).
It is not a problem in our case because the hashCode() implematation in Block uses both higher and lower bits of the block ID.
> 3. In "Arrays" section the GC behavior description was not clear. Not sure how the GC behavior is better with arrays?
The GC algorithm traverses the objects to determine which objects can be garbage collected. The GC behavior is better in arrays in the sense that there are fewer references in arrays.
> 2, 4, 5 & 6
All this items are related to configuration and the hash table length. See the new design doc.
gset20100608.pdf: rewrote Section 7