Paul_Dagnelie_Metaslab_Allocation_Performance_In_ZFS

Questions for Paul Dagnelie (Stream 1, Session 1)
Metaslab Allocation Performance in ZFS

1. jhb:
Have you thought about using range locks on the backing file up front before servicing an I/O request so that you could allow non-overlapping I/O requests to run in parallel?

2. double-p:
not much different from an MMU/TLB?

3. double-p:
but the main thing is differing block/page sizes, right?

4. What is the breed of your pupper?
A: Corgi/Dog

5. how much further can the in memory datastructure compressed with bitstuffing?

6. can the metaslabs be split into what is required to pick a metaslab and the actucal freemap?

7. did you compared the b-tree to an adaptive radix tree?

8. can you used a run length compressed bitmap? or even a roaring bitmap?

9. are there other AVL trees that might be replaced with B-trees to similar effect